Real-Time Language Recognition by Alternating Cellular Automata

  • Thomas Buchholz
  • Andreas Klein
  • Martin Kutrib
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1872)


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.


Time Complexity Cellular Automaton Computation Tree Universal State Cellular Space 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    Buchholz, Th., Klein, A., and Kutrib, M. One guess one-way cellular arrays. Mathematical Foundations in Computer Science1998, LNCS 1450, 1998, pp. 807–815.CrossRefGoogle Scholar
  2. [2]
    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
  3. [3]
    Chofirut, C. and ČulikII, K. On real-time cellular automata and trellis automata. Acta Inf. 21 (1984), 393–407.Google Scholar
  4. [4]
    Dyer, C.R. One-way bounded cellular automata Inform. Control 44 (1980), 261–281.MATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    Ibarra, O.H. and Jiang, T. Relating the power of cellular arrays to their closure properties. Theoret. Comput. Sci. 57 (1988), 225–238.CrossRefMathSciNetMATHGoogle Scholar
  6. [6]
    Ibarra, O.H. and Palis, M. A. Some results concerning linear iterative (systolic) arrays. J. Parallel and Distributed Comput. 2 (1985), 182–218.CrossRefGoogle Scholar
  7. [7]
    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
  8. [8]
    Iwamoto, C., Hatsuyama, T., Morita, K., and Imai, K. On time-constructible functions in one-dimensional cellular automata. Fundamentals of Computation Theory1999, LNCS 1684, 1999, pp. 317–326.CrossRefGoogle Scholar
  9. [9]
    Krithivasan, K. and Mahajan, M. Nondeterministic, probabilistic and alternating computations on cellular array models. Theoret. Comput. Sci. 143 (1995), 23–49.MATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    Matamala, M. Alternation on cellular automata. Theoret. Comput. Sci. 180 (1997), 229–241.MATHCrossRefMathSciNetGoogle Scholar
  11. [11]
    Mazoyer, J. A six-state minimal time solution to the firing squad synchronization problem. Theoret. Comput. Sci. 50 (1987), 183–238.MATHCrossRefMathSciNetGoogle Scholar
  12. [12]
    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
  13. [13]
    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
  14. [14]
    SmithIII, A.R. Real-time language recognition by one-dimensional cellular automata. J. Comput. System Sci. 6 (1972), 233–253.MATHMathSciNetGoogle Scholar
  15. [15]
    Umeo, H., Morita, K., and Sugata, K. Deterministic one-way simulation of two-way real-time cellular automata and its related problems. Inform. Process. Lett 14 (1982), 158–161.MATHCrossRefMathSciNetGoogle Scholar
  16. [16]
    Waksman, A. An optimum solution to the firing squad synchronization problem Inform. Control 9 (1966), 66–78.CrossRefMathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Thomas Buchholz
    • 1
  • Andreas Klein
    • 1
  • Martin Kutrib
    • 1
  1. 1.Institute of InformaticsUniversity of GiessenArndtstr. 2GiessenGermany

Personalised recommendations