Skip to main content

Topological Dynamics of Cellular Automata

  • Reference work entry
Book cover Encyclopedia of Complexity and Systems Science

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 3,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 549.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Abbreviations

Almost equicontinuous CA:

has an equicontinuous configuration.

Attractor:

omega-limit of a clopen invariant set.

Blocking word:

interrupts information flow.

Closing CA:

distinct asymptotic configurations have distinct images.

Column subshift:

columns in space-time diagrams.

Cross section:

one-sided inverse map.

Directional dynamics:

dynamics along a direction in the space-time diagram.

Equicontinuous configuration:

nearby configurations remain close.

Equicontinuous CA:

all configurations are equicontinuous.

Expansive CA:

distinct configurations get away.

Finite time attractor:

is attained in finite time from its neighborhood.

Jointly periodic configuration:

is periodic both for the shift and the CA.

Lyapunov exponents:

asymptotic speed of information propagation.

Maximal attractor:

omega-limit of the full space.

Nilpotent CA:

maximal attractor is a singleton.

Open CA:

image of an open set is open.

Permutive CA:

local rule permutes an extremal coordinate.

Quasi‐attractor:

a countable intersection of attractors.

Signal subshift:

weakly periodic configurations of a given period.

Spreading set:

clopen invariant set which propagates in both directions.

Subshift attractor:

limit set of a spreading set.

Bibliography

Primary Literature

  1. Acerbi L, Dennunzio A, Formenti E (2007) Shifting and lifting of a cellular automaton. In: Computational logic in the real world. Lecture Notes in Computer Sciences, vol 4497. Springer, Berlin, pp 1–10

    Google Scholar 

  2. Akin E, Auslander J, Berg K (1996) When is a transitive map chaotic? In: Bergelson, March, Rosenblatt (eds) Conference in Ergodic Theory and Probability. de Gruyter, Berlin, pp 25–40

    Google Scholar 

  3. Banks J, Brook J, Cains G, Davis G, Stacey P (1992) On Devaney's definition of chaos. Am Math Monthly 99:332–334

    MATH  Google Scholar 

  4. Blanchard F, Maass A (1996) Dynamical behaviour of Coven's aperiodic cellular automata. Theor Comput Sci 291:302

    MathSciNet  Google Scholar 

  5. Blanchard F, Tisseur P (2000) Some properties of cellular automata with equicontinuous points. Ann Inst Henri Poincaré 36:569–582

    MathSciNet  ADS  MATH  Google Scholar 

  6. Boyle M, Kitchens B (1999) Periodic points for onto cellular automata. Indag Math 10(4):483–493

    MathSciNet  MATH  Google Scholar 

  7. Boyle M, Lee B (2007) Jointly periodic points in cellular automata: computer explorations and conjectures. (manuscript)

    Google Scholar 

  8. Boyle M, Lind D (1997) Expansive subdynamics. Trans Am Math Soc 349(1):55–102

    MathSciNet  MATH  Google Scholar 

  9. Bressaud X, Tisseur P (2007) On a zero speed cellular automaton. Nonlinearity 20:1–19

    MathSciNet  ADS  MATH  Google Scholar 

  10. Codenotti B, Margara L (1996) Transitive cellular automata are sensitive. Am Math Mon 103:58–62

    MathSciNet  MATH  Google Scholar 

  11. Courbage M, Kamińnski B (2006) On the directional entropy of Z2‑actions generated by cellular automata. J Stat Phys 124(6):1499–1509

    Google Scholar 

  12. Coven EM (1980) Topological entropy of block maps. Proc Am Math Soc 78:590–594

    MathSciNet  MATH  Google Scholar 

  13. Coven EM, Hedlund GA (1979) Periods of some non‐linear shift registers. J Comb Theor A 27:186–197

    MathSciNet  MATH  Google Scholar 

  14. Coven EM, Pivato M, Yassawi R (2007) Prevalence of odometers in cellular automata. Proc Am Math Soc 815:821

    MathSciNet  Google Scholar 

  15. Culik K, Hurd L, Yu S (1990) Computation theoretic aspects of cellular automata. Phys D 45:357–378

    MathSciNet  MATH  Google Scholar 

  16. Formenti E, Kůrka P (2007) A search algorithm for the maximal attractor of a cellular automaton. In: Thomas W, Weil P (eds) STACS Lecture Notes in Computer Science, vol 4393. Springer, Berlin, pp 356–366

    Google Scholar 

  17. Formenti E, Kůrka P (2007) Subshift attractors of cellular automata. Nonlinearity 20:105–117

    Google Scholar 

  18. Gilman RH (1987) Classes of cellular automata. Ergod Theor Dynam Syst 7:105–118

    MathSciNet  MATH  Google Scholar 

  19. Hedlund GA (1969) Endomorphisms and automorphisms of the shift dynamical system. Math Syst Theory 3:320–375

    MathSciNet  MATH  Google Scholar 

  20. Hopcroft JE, Ullmann JD (1979) Introduction to Automata Theory, Languages and Computation. Addison-Wesley, London

    MATH  Google Scholar 

  21. Hurd LP (1990) Recursive cellular automata invariant sets. Complex Syst 4:119–129

    MathSciNet  MATH  Google Scholar 

  22. Hurley M (1990) Attractors in cellular automata. Ergod Theor Dynam Syst 10:131–140

    MathSciNet  MATH  Google Scholar 

  23. Kitchens BP (1998) Symbolic Dynamics. Springer, Berlin

    MATH  Google Scholar 

  24. Kůrka P (2003) Topological and symbolic dynamics, Cours spécialisés, vol 11. Société Mathématique de France, Paris

    Google Scholar 

  25. Kůrka P (2005) On the measure attractor of a cellular automaton. Discret Contin Dyn Syst 2005:524–535; supplement

    Google Scholar 

  26. Kůrka P (2007) Cellular automata with infinite number of subshift attractors. Complex Syst 17:219–230

    Google Scholar 

  27. Kůrka P (1997) Languages, equicontinuity and attractors in cellular automata. Ergod Theor Dynam Syst 17:417–433

    Google Scholar 

  28. Lena PD (2007) Decidable and computational properties of cellular automata, Ph D thesis. Universita de Bologna e Padova, Bologna

    Google Scholar 

  29. Lind D, Marcus B (1995) An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  30. Maass A (1995) On the sofic limit set of cellular automata. Ergod Theor Dyn Syst 15:663–684

    MathSciNet  MATH  Google Scholar 

  31. Milnor J (1988) On the entropy geometry of cellular automata. Complex Syst 2(3):357–385

    MathSciNet  ADS  MATH  Google Scholar 

  32. Moothathu TKS (2005) Homogenity of surjective cellular automata. Discret Contin Dyn Syst 13(1):195–202

    MATH  Google Scholar 

  33. Moothathu TKS (2006) Studies in topological dynamics with emphasis on cellular automata, Ph D thesis. University of Hyderabad, Hyderabad

    Google Scholar 

  34. Nasu M (1995) Textile Systems for Endomorphisms and Automorphisms of the Shift. Mem Am Math Soc 546

    Google Scholar 

  35. Nasu M (2006) Textile systems and one-sided resolving automorphisms and endomorphisms of the shift. American Mathematical Society, Providence

    Google Scholar 

  36. von Neumann J (1951) The general and logical theory of automata. In: Jefferss LA (ed) Cerebral Mechanics of Behaviour. Wiley, New York

    Google Scholar 

  37. Sablik M (2006) Étude de l'action conjointe d'un automate cellulaire et du décalage: une approche topologique et ergodique, Ph D thesis. Université de la Mediterranée, Marseille

    Google Scholar 

  38. Sablik M (2007) Directional dynamics of cellular automata: a sensitivity to initial conditions approach. Theor Comput Sci 400(1–3):1–18

    MathSciNet  Google Scholar 

  39. Shereshevski MA, Afraimovich VS (1992) Bipermutive cellular automata are topologically conjugated to the one-sided Bernoulli shift. Random Comput Dynam 1(1):91–98

    MathSciNet  Google Scholar 

  40. Smillie J (1988) Properties of the directional entropy function for cellular automata. In: Dynamical systems, vol 1342 of Lecture Notes in Mathematics. Springer, Berlin, pp 689–705

    Google Scholar 

  41. Wolfram S (1984) Computation theory of cellular automata. Comm Math Phys 96:15–57

    MathSciNet  ADS  MATH  Google Scholar 

  42. Wolfram S (1986) Theory and Applications of Cellular Automata. World Scientific, Singapore

    MATH  Google Scholar 

Books and Reviews

  1. Burks AW (1970) Essays on Cellular automata. University of Illinois Press, Chicago

    MATH  Google Scholar 

  2. Delorme M, Mazoyer J (1998) Cellular automata: A parallel Model. Kluwer, Amsterdam

    Google Scholar 

  3. Demongeot J, Goles E, Tchuente M (1985) Dynamical systems and cellular automata. Academic Press, New York

    MATH  Google Scholar 

  4. Farmer JD, Toffoli T, Wolfram S (1984) Cellular automata. North‐Holland, Amsterdam

    MATH  Google Scholar 

  5. Garzon M (1995) Models of Massive Parallelism: Analysis of Cellular automata and Neural Networks. Springer, Berlin

    MATH  Google Scholar 

  6. Goles E, Martinez S (1994) Cellular automata, Dynamical Systems and Neural Networks. Kluwer, Amsterdam

    MATH  Google Scholar 

  7. Goles E, Martinez S (1996) Dynamics of Complex Interacting Systems. Kluwer, Amsterdam

    MATH  Google Scholar 

  8. Gutowitz H (1991) Cellular Automata: Theory and Experiment. MIT Press/Bradford Books, Cambridge Mass. ISBN 0-262-57086-6

    MATH  Google Scholar 

  9. Kitchens BP (1998) Symbolic Dynamics. Springer, Berlin

    MATH  Google Scholar 

  10. Kůrka P (2003) Topological and symbolic dynamics. Cours spécialisés, vol 11. Société Mathématique de France, Paris

    Google Scholar 

  11. Lind D, Marcus B (1995) An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  12. Macucci M (2006) Quantum Cellular automata: Theory, Experimentation and Prospects. World Scientific, London

    Google Scholar 

  13. Manneville P, Boccara N, Vichniac G, Bidaux R (1989) Cellular automata and the modeling of complex physical systems. Springer, Berlin

    MATH  Google Scholar 

  14. Moore C (2003) New Constructions in Cellular automata. Oxford University Press, Oxford

    MATH  Google Scholar 

  15. Toffoli T, Margolus N (1987) Cellular Automata Machines: A New Environment for Modeling. Mass MIT Press, Cambridge

    Google Scholar 

  16. von Neumann J (1951) The general and logical theory of automata. In: Jefferss LA (ed) Cerebral Mechanics of Behaviour. Wiley, New York

    Google Scholar 

  17. Wolfram S (1986) Theory and applications of cellular automata. World Scientific, Singapore

    MATH  Google Scholar 

  18. Wolfram S (2002) A new kind of science. Media Inc, Champaign

    MATH  Google Scholar 

  19. Wuensche A, Lesser M (1992) The Global Dynamics of Cellular Automata. In: Santa Fe Institute Studies in the Sciences of Complexity, vol 1. Addison-Wesley, London

    Google Scholar 

Download references

Acknowledgments

I thank Marcus Pivato and Mathieu Sablik for careful reading of the paper and manyvaluable suggestions. The research was partially supported by the Research Program CTS MSM 0021620845.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag

About this entry

Cite this entry

Kůrka, P. (2009). Topological Dynamics of Cellular Automata. In: Meyers, R. (eds) Encyclopedia of Complexity and Systems Science. Springer, New York, NY. https://doi.org/10.1007/978-0-387-30440-3_556

Download citation

Publish with us

Policies and ethics