Skip to main content
Springer Nature Link
Log in

Non-uniform Cellular Automata

  • Conference paper
Language and Automata Theory and Applications (LATA 2009)

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

Abstract

In this paper we begin the study the dynamical behavior of non-uniform cellular automata and compare it to the behavior of “classical” cellular automata. In particular we focus on surjectivity and equicontinuity.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Farina, F., Dennunzio, A.: A predator-prey ca with parasitic interactions and environmentals effects. Fundamenta Informaticae 83, 337–353 (2008)

    MathSciNet  MATH  Google Scholar 

  2. Chaudhuri, P., Chowdhury, D., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata Theory and Applications, vol. 1. IEEE Press, Los Alamitos (1997)

    MATH  Google Scholar 

  3. Chopard, B.: Modelling physical systems by cellular automata. In: Rozenberg, G., et al. (eds.) Handbook of Natural Computing: Theory, Experiments, and Applications. Springer, Heidelberg (to appear, 2009)

    Google Scholar 

  4. 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 

  5. 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 

  6. 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 

  7. 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 

  8. Di Lena, P., Margara, L.: Undecidable properties of limit set dynamics of cellular automata. In: 26th Symposium on Theoretical Aspects of Computer Science (STACS 2009). LNCS. Springer, Heidelberg (to appear, 2009)

    Google Scholar 

  9. Di Lena, P., Margara, L.: Computational complexity of dynamical systems: the case of cellular automata. Information and Computation 206, 1104–1116 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Dennunzio, A., Formenti, E.: Decidable properties of 2D cellular automata. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 264–275. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Dennunzio, A., Formenti, E., Kůrka, P.: Cellular automata dynamical systems. In: Rozenberg, G., et al. (eds.) Handbook of Natural Computing: Theory, Experiments, and Applications. Springer, Heidelberg (to appear, 2009)

    Google Scholar 

  12. Dennunzio, A., Formenti, E.: 2D cellular automata: new constructions and decidable properties (submitted, 2009)

    Google Scholar 

  13. Acerbi, L., Dennunzio, A., Formenti, E.: Conservation of some dynamcal properties for operations on cellular automata. Theoretical Computer Science (to appear, 2009)

    Google Scholar 

  14. Dennunzio, A., Di Lena, P., Formenti, E., Margara, L.: On the directional dynamics of additive cellular automata. Theoretical Computer Science (to appear, 2009)

    Google Scholar 

  15. Dennunzio, A., Masson, B., Guillon, P.: Sand automata as cellular automata (submitted, 2009)

    Google Scholar 

  16. Dennunzio, A., Guillon, P., Masson, B.: Stable dynamics of sand automata. In: Fifth IFIP Confercence on Theoretical Computer Science (TCS 2008). IFIP, vol. 273, pp. 157–179. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  18. Moore, E.F.: Machine models of self-reproduction. In: Proceedings of Symposia in Applied Mathematics, vol. 14, pp. 13–33 (1962)

    Google Scholar 

  19. Myhill, J.: The converse to Moore’s garden-of-eden theorem. Proceedings of the American Mathematical Society 14, 685–686 (1963)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  21. Kůrka, P.: Languages, equicontinuity and attractors in cellular automata. Ergodic Theory & Dynamical Systems 17, 417–433 (1997)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  23. Knudsen, C.: Chaos without nonperiodicity. American Mathematical Monthly 101, 563–565 (1994)

    Article  MathSciNet  MATH  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

    Gianpiero Cattaneo & Alberto Dennunzio

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

    Enrico Formenti

  3. Ecole Normale Supérieure de Lyon, 46, Allée d’Italie, 69364, Lyon, France

    Julien Provillard

Authors
  1. Gianpiero Cattaneo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alberto Dennunzio
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Enrico Formenti
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Julien Provillard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Av. Catalunya, 35, 43002, Tarragona, Spain

    Adrian Horia Dediu

  2. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, Spain

    Armand Mihai Ionescu

  3. European Research Council Executive Agency, 16 Place Rogier, 1210, Brussels, Belgium

    Carlos Martín-Vide

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cattaneo, G., Dennunzio, A., Formenti, E., Provillard, J. (2009). Non-uniform Cellular Automata. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2009. Lecture Notes in Computer Science, vol 5457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00982-2_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00982-2_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00981-5

  • Online ISBN: 978-3-642-00982-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics