Real-Time Language Recognition by Alternating Cellular Automata
The capabilities of alternating cellular automata (ACA) to accept formal languages are investigated. Several notions of alternation in cellular automata have been proposed. Here we study so-called nonuni-form ACAs. Our investigations center on space bounded real-time com-putations. In particular, we prove that there is no difierence in accep-tance power regardless of whether one-way or two-way communication lines are provided. Moreover, the relations between real-time ACAs and deterministic (CA) and nondeterministic (NCA) cellular automata are investigated. It is proved that even the real-time ACAs gain exponential speed-up against nondeterministic NCAs. Comparing ACAs with deter-ministic CAs it is shown that real-time ACAs are strictly more powerful than real-time CAs.
KeywordsTime Complexity Cellular Automaton Computation Tree Universal State Cellular Space
- Buchholz, Th., Klein, A., and Kutrib, M. Real-time language recognition by alternating cellular automata. IFIG Research Report 9904, Institute of Informatics, University of Giessen, 1999.Google Scholar
- Chofirut, C. and ČulikII, K. On real-time cellular automata and trellis automata. Acta Inf. 21 (1984), 393–407.Google Scholar
- Ito, A., Inoue, K., and Wang, Y. Alternating automata characterizations of oneway iterative arrays. International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, 1999, pp. 119–128.Google Scholar
- Reischle, F. and Worsch, Th. Simulations between alternating CA, alternating TM and circuit families. Technical Report 9/98, Fakultät für Informatik, Universität Karlsruhe, 1998.Google Scholar
- Seidel, S.R. Language recognition and the synchronization of cellular automata. Technical Report 79-02, Department of Computer Science, University of Iowa, Iowa City, 1979.Google Scholar