On configurations in cellular automata

  • Peter Mikulecký
Automata Theory
Part of the Lecture Notes in Computer Science book series (LNCS, volume 28)


For the class of d-dimensional cellular automata, two general decision questions concerning the existence and recognizability of certain general "qualitative" properties of configurations in these automata are formulated. The problems can be stated as follows:
  1. 1.

    Given a general property of configurations, does a configuration with this property exist in a cellular automaton ?

  2. 2.

    Given a configuration in a cellular automaton, can we recognize certain (given) property of this configuration ?


Some particular questions of both types are investigated and a review of known results and open questions in the area is presented.


General Property Cellular Automaton Stable Configuration Local Transformation Finite Support 
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]
    AMOROSO, S.; COOPER, G. Garden-of-Eden theorem for finite configurations. Proc. Amer. Math. Soc. 26 (1970), 158–164.Google Scholar
  2. [2]
    AMOROSO, S.; PATT, Y.N. Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures. Journal Comp. Sys. Sci. 6 (1972), 448–464.Google Scholar
  3. [3]
    CODD, E.F. Cellular Automata. Academic Press, New York, 1968.Google Scholar
  4. [4]
    GARDNER, M. On cellular automata, self-reproduction, the Garden-of-Eden, and the game "life". Sci.Amer. 224 (1971), 112–117.Google Scholar
  5. [5]
    HVORECKY, J. Homogénne štruktúry. Unpublished manuscript (1974).Google Scholar
  6. [6]
    MINSKI, M.L. Computation:Finite and Infinite Machines. Prentice-Hall, 1967.Google Scholar
  7. [7]
    WAINWRIGHT, R.T. Lifeline. A private publication on the game "life", New York, 1972.Google Scholar
  8. [8]
    YAKU, T. The constructibility of a configuration in a cellular automaton. Journal Comp.Sys.Sci. 7 (1973), 481–496.Google Scholar
  9. [9]
    YAMADA, H.; AMOROSO, S. Tessellation automata. Inf.Control 14 (1969), 299–317.Google Scholar
  10. [10]
    YAMADA, H.; AMOROSO, S. A completeness problem for pattern generation in tessellation automata. Journal Comp.Sys.Sci. 4 (1970), 137–176.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Peter Mikulecký
    • 1
  1. 1.Institute of Applied Mathematics Faculty of Natural SciencesKomenský UniversityBratislavaCzechoslovakia

Personalised recommendations