644 search results - page 43 / 129 » Precedence Automata and Languages |
112
Voted
ALT
2006
Springer
15 years 8 months ago
2006
Springer
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
108
Voted
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
85
Voted
ICALP
2000
Springer
15 years 3 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
110
click to vote
IANDC
2011
14 years 6 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...