Summary
It is proved that the set of all languages accepted within a fixed, language dependent number of steps by deterministic one dimensional cellular acceptors is a proper subset of the set of all regular languages.
A combinatorial condition is stated which is necessary and sufficient for a language to be recognizable in constant time by a deterministic one dimensional cellular automaton.
It is shown that the question of whether or not the language generated by a given context-sensitive grammar is recognizable in constant time is algorithmically unsolvable. The question becomes solvable if a regular grammar is given.
Finally it is proved that the set of all languages that can be accepted by non-deterministic one dimensional cellular acceptors is equal to the set of all regular languages.
In conclusion some generalizations to n-dimensional languages and array languages are mentioned.
Similar content being viewed by others
References
Codd, E.F.: Cellular Automata. Academic Press, 1968
Collard, R.F.A.: Cellulaire Patroonherkenners. Unpublished manuscript, 1977
Eilenberg, S.: Automata, Languages and Machines, Vol. A. Academic Press, 1974
Kuroda, S.Y.: Classes of Languages and linear bounded automata. Information and Control 7, 206–223 (1964)
McNaughton, R., Papert, S.: Counter-free Automata. MIT Press, 1971
Milgram, D.L., Rosenfeld, A.: Array automata and array grammars. Information Processing 71, 69–74 (1972)
Siromoney, G., Siromoney, R., Krishivasan, K.: Abstract families of matrices and picture languages. Comput. Graphics and Image Processing 1, 284–307 (1972)
Smith III, A.R.: Real-time language recognition by one-dimensional cellular automata. J. Comput. System Sci. 6, 233–253 (1972)
Smith III, A.R.: Cellular automata and formal languages. Proc. XI-th annual IEEE Symp. on Switching and Automata Theory, pp. 216–223 Santa Monica, CA, 1970
Smith III, A.R.: Introduction to and survey of poly-automata theory. Automata, Languages and Development. Lindenmayer, A., Rozenberg, G. (eds.). North-Holland, pp. 405–422, 1976
Vollmar, T.: Cellular Spaces and Parallel Algorithms, an introductory survey. Parallel Computation — Parallel Mathematics. Feilmeier, M. (ed.). North Holland, pp. 49–58, 1977
Vollmar, T.: On cellular automata with a finite number of state changes. Computing, Suppl. 3, 181–191 (1981)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sommerhalder, R., van Westrhenen, S.C. Parallel language recognition in constant time by cellular automata. Acta Informatica 19, 397–407 (1983). https://doi.org/10.1007/BF00290736
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00290736