Skip to main content

The Dynamics of Cellular Automata in Shift-Invariant Topologies

  • Conference paper
Developments in Language Theory (DLT 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4588))

Included in the following conference series:

Abstract

We study the dynamics of cellular automata, and more specifically their transitivity and expansivity, when the set of configurations is endowed with a shift-invariant (pseudo-)distance. We first give an original proof of the non-transitivity of cellular automata when the set of configurations is endowed with the Besicovitch pseudo-distance. We then show that the Besicovitch pseudo-distance induces a distance on the set of shift-invariant measures and on the whole space of measures, and we prove that in these spaces also, cellular automata cannot be expansive nor transitive.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blanchard, F., Cervelle, J., Formenti, E.: Periodicity and transitivity for cellular automata in Besicovitch topologies. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 228–238. Springer, Heidelberg (2003)

    Google Scholar 

  2. Cellular automata in the Cantor, Besicovitch, and Weyl topological spaces. Complex Systems 11(2), 107–123 (1997)

    Google Scholar 

  3. Brudno, A.A.: Entropy and the complexity of the trajectories of a dynamic system. Trudy Moskov. Mat. Obshch. 44, 124–149 (1982)

    MathSciNet  MATH  Google Scholar 

  4. Calude, C.: Information theory and randomness: an algorithmic perspective, 2nd edn. Spinger, Berlin Heidelberg (2002)

    Google Scholar 

  5. Cattaneo, G., Formenti, E., Margara, L., Mazoyer, J.: A shift-invariant metric on S Z inducing a non-trivial topology. In: Privara, I., Ružička, P. (eds.) MFCS 1997. LNCS, vol. 1295, pp. 179–188. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  6. Delorme, M., Formenti, E., Mazoyer, J.: Open problems on cellular automata. Technical report RR-2000-25, Ecole Normale Supérieure de Lyon (2000)

    Google Scholar 

  7. Denker, M., Grillenberger, C., Sigmund, K.: Ergodic theory on compact spaces. Lecture Notes in Mathematics, vol. 527. Springer-Verlag, Berlin Heidelberg (1976)

    MATH  Google Scholar 

  8. Eggleston, H.G.: The fractional dimension of a set defined by decimal properties. Quarterly Journal of Mathematics, Oxford Series 20, 31–36 (1949)

    Article  MathSciNet  Google Scholar 

  9. Falconer, K.: The geometry of fractal sets. Cambridge University Press, Cambridge (1985)

    MATH  Google Scholar 

  10. Hedlund, G.A.: Endormorphisms and automorphisms of the shift dynamical system. Math. Systems Theory 3, 320–375 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lutz, J.: Dimension in complexity classes. In: CCC 2000. Conference on Computational Complexity, pp. 158–169. IEEE Computer Society, Los Alamitos (2000)

    Google Scholar 

  12. Li, M., Vitanyi, P.: An introduction to Kolmogorov complexity and its applications, 2nd edn. Spinger, Berlin Heidelberg (1997)

    MATH  Google Scholar 

  13. Manzini, G.: Characterization of sensitive linear automata with respect to the couting distance. In: Mathematical Foundations of Computer Science (1998)

    Google Scholar 

  14. Mayordomo, E.: A Kolmogorov complexity characterization of constructive Hausdorff dimension. Information Processing Letters 84, 1–3 (2000)

    Article  MathSciNet  Google Scholar 

  15. Sablik, M.: Action of Cellular automata on σ-invariant probability measure. Prépublication de l’UMPA (September 2006), www.umpa.ens-lyon.fr/~msablik

Download references

Author information

Authors and Affiliations

Authors

Editor information

Tero Harju Juhani Karhumäki Arto Lepistö

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bienvenu, L., Sablik, M. (2007). The Dynamics of Cellular Automata in Shift-Invariant Topologies. In: Harju, T., Karhumäki, J., Lepistö, A. (eds) Developments in Language Theory. DLT 2007. Lecture Notes in Computer Science, vol 4588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73208-2_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73208-2_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73207-5

  • Online ISBN: 978-3-540-73208-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics