Cellular automata and formal languages

Authors:
Alvy Ray Smith
Affiliations:
-
Venue:
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Year:
1970

Citing 0
Cited 5

Cellular Automata with Sparse Communication

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Real-time language recognition by one-dimensional cellular automata

Journal of Computer and System Sciences
Cellular automata with sparse communication

Theoretical Computer Science
The boolean closure of linear context-free languages

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Space- and Time-Bounded Nondeterminism for Cellular Automata

Fundamenta Informaticae - Cellular Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

A set of equivalences is established among cellular automata, iterative acceptors, and linear-bounded automata. However, cellular automata are shown to be inherently faster than iterative acceptors. Many positive results are presented to indicate that the context-free languages can, perhaps, be accepted in time n and space n by cellular automata.