On real-time cellular automata and trellis automata
Acta Informatica
Systolic Trellis automata: stability, decidability and complexity
Information and Control
On real time one-way cellular array
Theoretical Computer Science
Signals in one-dimensional cellular automata
Theoretical Computer Science - Special issue: cellular automata
Automata arrays and context-free languages
Where mathematics, computer science, linguistics and biology meet
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
One Guess One-Way Cellular Arrays
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On the Succintness of Different Representations of Languages
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
On one-way cellular automata with a fixed number of cells
Fundamenta Informaticae - Special issue on cellular automata
On the number of nonterminals in linear conjunctive grammars
Theoretical Computer Science
On the descriptional power of heads, counters, and pebbles
Theoretical Computer Science - Descriptional complexity of formal systems
On two-way communication in cellular automata with a fixed number of cells
Theoretical Computer Science - Descriptional complexity of formal systems
State complexity of linear conjunctive languages
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Non-recursive trade-offs for deterministic restarting automata
Journal of Automata, Languages and Combinatorics
On recursive and non-recursive trade-offs between finite-turn pushdown automata
Journal of Automata, Languages and Combinatorics
On the descriptional complexity of CD grammar systems of finite index
Journal of Automata, Languages and Combinatorics
Cellular Automata with Sparse Communication
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Real-time reversible iterative arrays
Theoretical Computer Science
Cellular automata with sparse communication
Theoretical Computer Science
Undecidability and hierarchy results for parallel communicating finite automata
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Descriptional complexity of two-way pushdown automata with restricted head reversals
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Descriptional complexity of two-way pushdown automata with restricted head reversals
Theoretical Computer Science
On One-Way Cellular Automata with a Fixed Number of Cells
Fundamenta Informaticae - Cellular Automata
| Hi-index | 0.00 |
We study the descriptional complexity of cellular automata (CA) which are a parallel model of computation. We show that between one of the simplest cellular models, the realtime one-way CA (realtime-OCA), and "classical" models like deterministic finite automata or pushdown automata, there will be savings concerning the size of description not bounded by any recursive function, so-called nonrecursive trade-offs. Furthermore, nonrecursive trade-offs are shown to exist between certain restricted classes of cellular automata. The set of valid computations of a Turing machine can be recognized by a realtime-OCA. This implies that many decidability questions are not even semidecidable for cellular automata. There is no pumping lemma and no minimization algorithm for cellular automata. Finally, we prove that the language class accepted by realtime-OCA is incomparable to many known and well-investigated language classes.