论文信息 - Cellular Automata and Formal Languages

Cellular Automata and Formal Languages

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.

Alvy Ray Smith

[1] Stephen N. Cole. Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines , 1969, IEEE Trans. Computers.

[2] Tadao Kasami. A Note on Computing Time for Recognition of Languages Generated by Linear Grammars , 1967, Inf. Control..

[3] Abraham Waksman,et al. An Optimum Solution to the Firing Squad Synchronization Problem , 1966, Inf. Control..

[4] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .

[5] Daniel H. Younger,et al. Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..

[6] Patrick C. Fischer,et al. Generation of Primes by a One-Dimensional Real-Time Iterative Array , 1965, JACM.

[7] S.-Y. Kuroda,et al. Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..

[8] Alvy Ray Smith,et al. Cellular automata theory , 1969 .