Skip to main content
SpringerLink
Log in

Decidable Properties of 2D Cellular Automata

  • Conference paper
Developments in Language Theory (DLT 2008)

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

Included in the following conference series:

Abstract

In this paper we study some decidable properties of two-dimensional cellular automata (2D CA). The notion of closingness is generalized to the 2D case and it is linked to permutivity and openness. The major contributions of this work are two deep constructions which have been fundamental in order to prove our new results and we strongly believe it will be a valuable tool for proving other new ones in the near future.

This work has been supported by the Interlink/MIUR project “Cellular Automata: Topological Properties, Chaos and Associated Formal Languages”, by the ANR Blanc “Projet Sycomore” and by the PRIN/MIUR project “Formal Languages and Automata: Mathematical and Applicative Aspects”.

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

Access this chapter

Log in via an institution
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. Acerbi, L., Dennunzio, A., Formenti, E.: Shifting and lifting of cellular automata. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol. 4497, pp. 1–10. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Amoroso, S., Patt, Y.N.: Decision procedures for surjectivity and injectivity of parallel maps for tesselation structures. Journal of Computer and System Sciences 6, 448–464 (1972)

    MATH  MathSciNet  Google Scholar 

  3. Bernardi, V., Durand, B., Formenti, E., Kari, J.: A new dimension sensitive property for cellular automata. Theoretical Computer Science 345, 235–247 (2005)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Cattaneo, G., Dennunzio, A., Margara, L.: Chaotic subshifts and related languages applications to one-dimensional cellular automata. Fundamenta Informaticae 52, 39–80 (2002)

    MATH  MathSciNet  Google Scholar 

  6. Cattaneo, G., Dennunzio, A., Margara, L.: Solution of some conjectures about topological properties of linear cellular automata. Theoretical Computer Science 325, 249–271 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Cervelle, J., Dennunzio, A., Formenti, E.: Chaotic behavior of cellular automata. In: Meyers, B. (ed.) Mathematical basis of cellular automata, Encyclopedia of Complexity and System Science. Springer, Heidelberg (2008)

    Google Scholar 

  8. Durand, B.: Global properties of 2d cellular automata: Some complexity results. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 433–441. Springer, Heidelberg (1993)

    Google Scholar 

  9. Durand, B.: Global properties of cellular automata. In: Goles, E., Martinez, S. (eds.) Cellular Automata and Complex Systems. Kluwer, Dordrecht (1998)

    Google Scholar 

  10. Formenti, E., Kůrka, P.: Dynamics of cellular automata in non-compact spaces. In: Meyers, B. (ed.) Mathematical basis of cellular automata, Encyclopedia of Complexity and System Science. Springer, Heidelberg (2008)

    Google Scholar 

  11. Hedlund, G.A.: Endomorphisms and automorphisms of the shift dynamical system. Mathematical System Theory 3, 320–375 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  12. Kari, J.: Reversibility and surjectivity problems of cellular automata. Journal of Computer and System Sciences 48, 149–182 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kari, J.: Tiling problem and undecidability in cellular automata. In: Meyers, B. (ed.) Mathematical basis of cellular automata, Encyclopedia of Complexity and System Science. Springer, Heidelberg (2008)

    Google Scholar 

  14. Kůrka, P.: Topological and Symbolic Dynamics. Cours Spécialisés, vol. 11. Société Mathématique de France (2004)

    Google Scholar 

  15. Kůrka, P.: Topological dynamics of one-dimensional cellular automata. In: Meyers, B. (ed.) Mathematical basis of cellular automata, Encyclopedia of Complexity and System Science. Springer, Heidelberg (2008)

    Google Scholar 

  16. Di Lena, P., Margara, L.: Computational complexity of dynamical systems: the case of cellular automata. Information and Computation (to appear, 2008)

    Google Scholar 

  17. Margara, L.: On some topological properties of linear cellular automata. In: Kutyłowski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 209–219. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  18. Pivato, M.: The ergodic theory of cellular automata. In: Meyers, B. (ed.) Mathematical basis of cellular automata, Encyclopedia of Complexity and System Science. Springer, Heidelberg (2008)

    Google Scholar 

  19. Theyssier, G., Sablik, M.: Topological dynamics of 2d cellular automata. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 523–532. Springer, Heidelberg (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano–Bicocca, Viale Sarca 336, 20126, Milano, Italy

    Alberto Dennunzio

  2. Laboratoire I3S, Université de Nice-Sophia Antipolis, 2000 Route des Colles, 06903, Sophia Antipolis, France

    Enrico Formenti

Authors
  1. Alberto Dennunzio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Enrico Formenti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Masami Ito Masafumi Toyama

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dennunzio, A., Formenti, E. (2008). Decidable Properties of 2D Cellular Automata. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2008. Lecture Notes in Computer Science, vol 5257. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85780-8_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85780-8_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85779-2

  • Online ISBN: 978-3-540-85780-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation