Linear Cellular Automata and de Bruijn Automata

  • K. Sutner
Chapter
Part of the Mathematics and Its Applications book series (MAIA, volume 460)

Abstract

Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiautomata, provide a natural setting for the study of cellular automata. For example, we give a simple algorithm to determine reversibility and surjectivity of the global maps. We also comment on Wolfram’s question about the growth rates of the minimal finite state machines associated with iterates of a cellular automaton.

Keywords

Cellular Automaton Finite Type Regular Language Shift Space Finite Word 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amoroso S. and Patt Y.N. Decision procedures for surjectivity and injectivity of parallel maps for tesselation structures. Journal of Computer and Systems Sciences Vol. no. 6: 448–464, 1972.MathSciNetMATHGoogle Scholar
  2. Beauquier D. Minimal automaton for a factorial, transitive, rational language. Theoretical Computer Science Vol. no. 67: 65–73, 1989.MathSciNetMATHCrossRefGoogle Scholar
  3. Burks E.W. Essays on Cellular Automata University of Illinois Press, 1972.Google Scholar
  4. Coven E.M. and Paul M.E. Sofic systems. Israel J. of Mathematics Vol. 20 no. 2: 165–177, 1975.MathSciNetCrossRefGoogle Scholar
  5. Culik II K., Pachl J. and Yu S. On the limit sets of cellular automata. SIAM Journal on Computing Vol. 18 no. 4: 831–842, 1989.MathSciNetGoogle Scholar
  6. Fischer R. Sofic systems and graphs. Monatshefte fur Mathematik Vol. no. 80: 179–186, 1975.MATHCrossRefGoogle Scholar
  7. Gleason A. Semigroups of shift register counting matrices. Math. Systems Theory Vol. no. 25: 253–267, 1992, Revised by Kochman F., Neuwirth L.Google Scholar
  8. Goles E., Maass A. and Martinez S. On the limit set of some universal cellular automata. Theoretical Computer Science Vol. no. 110: 53–78, 1993.MathSciNetMATHGoogle Scholar
  9. Golze U. Differences between 1- and 2-dimensional cell spaces. in Lindenmayer A. and Rozenberg G., editors, Automata, Languages and Development North-Holland, 369384, 1976.Google Scholar
  10. Head T. Linear CA: injectivity from ambiguity. Complex Systems Vol. 3 no. 4: 343–348, 1989.MathSciNetGoogle Scholar
  11. Hedlund G. A. Endomorphisms and automorphisms of the shift dynamical system. in Z. Kohavi, editor, The theory of machines and computation Academic Press, New York, 320–375, 1971.Google Scholar
  12. Hoperoft J.E. An n log n algorithm for minimizing states in a finite automaton. Math. Systems Theory Vol. no. 3: 189–196, 1971.Google Scholar
  13. Hurd L. Formal language characterizations of cellular automata limit sets. Complex Systems Vol. 1 no. 1: 69–80, 1987.MathSciNetMATHGoogle Scholar
  14. Lind D. and Marcus B. Introduction to Symbolic Dynamics and Coding. Cambridge University Press, 1995.Google Scholar
  15. Mehlhorn K. Data Structures and Algorithms, vol. II: Graph Algorithms and NP-Completeness. Springer-Verlag, 1984.Google Scholar
  16. Moore E. F. Machine models of self-reproduction. Proc. Symp. Appl. Math. Vol. no. 14: 17–33, 1962.CrossRefGoogle Scholar
  17. Myhill J. The converse of moore’s garden-of-eden theorem. Proc. AMS Vol. no. 14: 685–686, 1963.MathSciNetMATHGoogle Scholar
  18. Nasu M. Homomorphisms of graphs and their global maps. in Saito N. and Nishiziki T., editors, Graph theory and algorithms, Springer Verlag, LNCS 108:159–170, 1981. Papadimitriou C.H. Computational Complexity. Addison-Wesley, 1994.Google Scholar
  19. Sutner K. Linear cellular automata and Fischer automata. To appear in Parallel Computing.Google Scholar
  20. Sutner K. De Bruijn graphs and linear cellular automata. Complex Systems Vol.5 no. 1: 19–30, 1991.MathSciNetGoogle Scholar
  21. Sutner K. The size of power automata. Submitted, 1997.Google Scholar
  22. Weiss B. Subshifts of finite type and sofic systems. Monatshefte für Mathematik Vol. no. 77: 462–474, 1973.MATHCrossRefGoogle Scholar
  23. Wolfram S. Twenty problems in the theory of cellular automata. Physica Scripta Vol. no. 79: 170–183, 1985.MathSciNetGoogle Scholar
  24. Wolfram S. Theory and Applications of Cellular Automata,World Scientific, 1986.Google Scholar
  25. Yu S. Regular languages. in Rozenberg G. and Salomaa A., editors, Handbook of Formal Languages, Springer Verlag, volume 1, chapter 2, 1997.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1999

Authors and Affiliations

  • K. Sutner
    • 1
  1. 1.Carnegie Mellon UniversityPittsburghUSA

Personalised recommendations