One guess one-way cellular arrays

  • Thomas Buchholz
  • Andreas Klein
  • Martin Kutrib
Contributed Papers Cellular Automata
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1450)


One-way cellular automata with restricted nondeterminism are investigated. The number of allowed nondeterministic state transitions is limited to a constant. It is shown that a limit to exactly one step does not decrease the language accepting capabilities. We prove a speed-up result that allows any linear-time computation to be sped-up to real-time. Some relationships to deterministic arrays are considered. Finally we prove several closure properties of the real-time languages.


Cellular Automaton Finite Automaton Closure Property Global Transition Language Recognition 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Bucher, W., čulik II, K.: On real time and linear time cellular automata. RAIRO Inform. Théor. 18 (1984) 307–325MATHGoogle Scholar
  2. [2]
    Buchholz, Th., Kutrib, M.: On time computability of functions in one-way cellular automata. Acta Inf. 35 (1998) 329–352MATHMathSciNetCrossRefGoogle Scholar
  3. [3]
    Buchholz, Th., Klein, A., Kutrib, M.: One guess one-way cellular arrays. Research Report 9801, Institute of Informatics, University of Giessen, Gießen, 1998.Google Scholar
  4. [4]
    Choffrut, C., čulik II, K.: On real-time cellular automata and trellis automata. Acta Inf. 21 (1984) 393–407MATHGoogle Scholar
  5. [5]
    čulik II, K., Gruska, J., Salomaa, A.: Systolic trellis automata I. Internat. J. Comput. Math. 15 (1984) 195–212MathSciNetGoogle Scholar
  6. [6]
    čulik II, K., Gruska, J., Salomaa, A.: Systolic trellis automata II. Internat. J. Comput. Math. 16 (1984) 3–22MathSciNetGoogle Scholar
  7. [7]
    Dyer, C. R.: One-way bounded cellular automata. Inform. Control 44 (1980) 261–281MATHMathSciNetCrossRefGoogle Scholar
  8. [8]
    Ginsburg, S., Hopcroft, J. E.: Two-way balloon automata and AFL. J. Assoc. Comput. Mach. 17 (1970) 3–13MATHMathSciNetGoogle Scholar
  9. [9]
    Ibarra, O. H., Jiang, T.: On one-way cellular arrays. SIAM J. Comput. 16 (1987) 1135–1154MATHMathSciNetCrossRefGoogle Scholar
  10. [10]
    Ibarra, O. H., Kim, S. M.: Characterizations and computational complexity of systolic trellis automata. Theoret. Comput. Sci. 29 (1984) 123–153MathSciNetCrossRefGoogle Scholar
  11. [11]
    Ibarra, O. H., Palis, M. A.: Some results concerning linear iterative (systolic) arrays. J. Parallel and Distributed Comput. 2 (1985) 182–218CrossRefGoogle Scholar
  12. [12]
    Kutrib, M.: Pushdown cellular automata. Theoret. Comput. Sci. (1998)Google Scholar
  13. [13]
    Kutrib, M., Richstein, J.: Real-time one-way pushdown cellular automata languages. In: Developments in Language Theory II. At the Crossroads of Mathematics, Computer Science and Biology, World Scientific, Singapore, (1996) 420–429Google Scholar
  14. [14]
    Seidel, S. R.: Language recognition and the synchronization of cellular automata. Technical Report 79-02, Department of Computer Science, University of Iowa, 1979Google Scholar
  15. [15]
    Smith III, A. R.: Real-time language recognition by one-dimensional cellular automata. J. Comput. System Sci. 6 (1972) 233–253MATHMathSciNetGoogle Scholar
  16. [16]
    Terrier, V.: Language recognizable in real time by cellular automata. Complex Systems 8 (1994) 325–336MATHMathSciNetGoogle Scholar
  17. [17]
    Umeo, H., Morita, K., Sugata, K.: Deterministic one-way simulation of two-way real-time cellular automata and its related problems. Inform. Process. Lett. 14 (1982) 158–161MATHMathSciNetCrossRefGoogle Scholar
  18. [18]
    Vollmar, R.: Algorithmen in Zellularautomaten. Teubner, Stuttgart, 1979MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Thomas Buchholz
    • 1
  • Andreas Klein
    • 1
  • Martin Kutrib
    • 1
  1. 1.Institute of InformaticsUniversity of GiessenGiessenGermany

Personalised recommendations