Computation-universality of one-dimensional one-way reversible cellular automata
Information Processing Letters
A universal cellular automaton in quasi-linear time and its S—m—n form
Theoretical Computer Science
Some relations between massively parallel arrays
Parallel Computing - Special issue: cellular automata
Theoretical Computer Science
Signals in one-dimensional cellular automata
Theoretical Computer Science - Special issue: cellular automata
A computation-universal two-dimensional 8-state triangular reversible cellular automaton
Theoretical Computer Science - Special issue on universal machines and computations
Frontier between decidability and undecidability: a survey
Theoretical Computer Science - Special issue on universal machines and computations
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Efficient Unidimensional Universal Cellular Automaton
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
On Time-Constructible Functions in One-Dimensional Cellular Automata
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
| Hi-index | 0.00 |
In order to obtain universal classical cellular automata infinite space is required. Therefore, the number of required processors depends on the length of input data and, additionally, may increase during the computation. On the other hand, Turing machines are universal devices which have one processor only and additionally an infinite storage tape. Here an in some sense intermediate model is studied. The pushdown cellular automata are a stack augmented generalization of classical cellular automata. They form a massively parallel universal model where the number of processors is bounded by the length of input data. Efficient universal pushdown cellular automata and their efficiently verifiable encodings are proposed. They are applied to computational complexity, and tight time and stack-space hierarchies are shown.