644 search results - page 59 / 129 » Precedence Automata and Languages |
147
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very litt...
127
click to vote
CSR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...
101
click to vote
BIRTHDAY
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We present a general methodology for non-deterministic programming based on pure functional programming. We construct families of automata constructions which are used as...
129
click to vote
BIRTHDAY
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s simple probabilistic automata. We consider...
134
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Signals are a classical tool of cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collision...