Time-space pattern and periodic property of elementary cellular automata — Sierpinski gasket and partially Sierpinski Gasket —

  • Fumio Ohi
  • Yoshikazu Takamatsu


Cellular automata have interested many researchers because of the unexpected complex time-space patterns that are generated by very simple rules of cellular automata. Especially Wolfram [5] [6] classified the cellular automata by computer simulations, and his work has inspired the research on cellular automata since then.

Braga et al. [1] gave an effective classification of cellular automata according to the behavior on the set of all the 0-finite configurations and showed an algorithmic method to classify 0-quiescent elementary cellular automata. They presented in the thesis a conjecture on the cellular automaton with rule number 180 by graphically observing the time-space patterns of the cellular automaton. The conjecture insisted that the dynamics determined by rule 180 was shift like, which they called generalized shift dynamics, and was proved to be true by Cattaneo et al. [2].

It is graphically understood that the time-space patterns of rule 180 are basically same to those cut off from the time-space patterns of rule 90. Braga et al. [1] and Cattaneo et al. [2] did not necessarily explain such the feature. They mainly concerned the topological behavior of the dynamics of cellular automata, and not on the time-space patterns.

In this article we logically prove that the time-space patterns of rule 180 are those cut off from the time-space patterns of rule 90, and then prove the conjecture of Braga et al. [1] in an extended case.

Key words

cellular automata rule number 180 rule number 90 periodic trajectory period 


  1. [1]
    G. Braga, G. Cattaneo, P. Flocchini and C. Quaranta Vogliotti, Pattern growth in elementary cellular automata. Theoret. Comput. Sci.,145 (1995), 1–26.MATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    G. Cattaneo and L. Margara, Generalized sub-shifts in elementary cellular automata: the “strange case” of chaotic rule 180. Theoret. Comput. Sci.,201 (1998), 171–187.MATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    C.G. Langton, Studying artificial life with cellular automata. Physica,22D (1986), 120–149.MathSciNetGoogle Scholar
  4. [4]
    C.G. Langton, Life at the edge of chaos. Artificial Life II, Proceedings of the Workshop on Artificial Life (eds. C.G. Langton, C. Taylor, J.D. Farmer and S. Rasmussen), February 1990, Santafe, New Mexico, Addison-Wesley Publishing Company, 1990, 41–91.Google Scholar
  5. [5]
    S. Wolfram, Statistical mechanics of cellular automata. Rev. Modern Phys.,55 (1983), 601–644.CrossRefMathSciNetGoogle Scholar
  6. [6]
    S. Wolfram, Universality and complexity in cellular automata. Physica,10D (1984), 1–35.MathSciNetGoogle Scholar

Copyright information

© JJIAM Publishing Committee 2001

Authors and Affiliations

  1. 1.Department of Systems EngineeringNagoya Institute of TechnologyNagoyaJapan
  2. 2.DENSO CREATE INC.NagoyaJapan

Personalised recommendations