Superposable Trellis Automata

  • Nicolas Reimen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 629)


A property of superposability is defined here for Treillis Automata as an equivalent of the linearity property of Cellular Automata. We take advantage of the binary local transition function of TAs, which enables us to use an infix notation for it, to study this property in an algebraic framework. We show that a TA is superposable iff its local transition function operates on its set of states as a commutative monoid law and that the general case of commutative monoids is reducible to the case of Abelian groups in which the space-time diagrams obtained are isomorphic to a superposition of figures representing the triangle of binomial coefficients (Pascal's triangle) modulo integers.


Cellular Automaton Initial Configuration Neutral Element Binomial Coefficient Commutative Monoid 
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]
    O. Martin, A.M. Odlyzko and S. Wolfram, “Algebraic properties of Cellular Automata”, Communications in Math. Physics 93(1984) 219–25.zbMATHMathSciNetCrossRefGoogle Scholar
  2. [2]
    S. Wolfram, “The Geometry of binomial coefficients”, American Mathematical Monthly (1984)566-571.Google Scholar
  3. [3]
    E. Jen, “Linear Cellular Automata and recurring sequences in finite fields”, Comm. in Math Physics 119(1988)13–28.zbMATHMathSciNetCrossRefGoogle Scholar
  4. [4]
    E. Jen, “Apperiodicity in one dimensional Cellular Automata”, Physica D 45(1990)3–18.zbMATHCrossRefGoogle Scholar
  5. [5]
    K. Culik and S. Dube, “Fractal and recurrent behaviour of Cellular Automata”, Complex Systems 3(1989) 253–267.zbMATHMathSciNetGoogle Scholar
  6. [6]
    K. Culik II and C. Choffrut, “On real-time Cellular Automata and Treillis Automata”, Acta. Inf. 21(1984) 393–407.zbMATHMathSciNetGoogle Scholar
  7. [7]
    K. Culik II, J. Gruska and A. Salomaa, “Systolic Treillis Automata (for VLSI)”, Res. rep. CS-81-34, Dept of Computer Science, Univ. of Waterloo, 1981.Google Scholar
  8. [8]
    B. Voorhees, “Cellular Automata and Pascal's Triangle”, Physica D 45 (1990) 135–140.MathSciNetCrossRefGoogle Scholar
  9. [9]
    O.H. Ibarra, S.M. Kim and S. Moran, “Sequential machines charracterizations of Treillis Automata and applications”, SIAM J. Comput. 14-2(1985) 426–447.MathSciNetCrossRefGoogle Scholar
  10. [10]
    O.H. Ibarra, J.H. Chang and A. Vergis, “On the power of one-way communication”, J. ACM 35-3(1988) 697–726.MathSciNetGoogle Scholar
  11. [11]
    C.T. Long, “Pascal's triangle modulo p”, Fibbonacci Quarterly 19(1981) 458–463.zbMATHGoogle Scholar
  12. [12]
    H. Aso and N. Honda, “Dynamical Characteristics of Linear Cellular Automata”, JCSS 30(1985) 291–317.zbMATHMathSciNetGoogle Scholar
  13. [13]
    M. Garzon, Cellular Automata, To be publishedGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Nicolas Reimen
    • 1
  1. 1.Institut Blaise PascalLITPParis

Personalised recommendations