Skip to main content
SpringerLink
Log in

Self-organization in Cellular Automata: A Particle-Based Approach

  • Conference paper
Developments in Language Theory (DLT 2011)

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

Included in the following conference series:

Abstract

For some classes of cellular automata, we observe empirically a phenomenon of self-organization: starting from a random configuration, regular strips separated by defects appear in the space-time diagram. When there is no creation of defects, all defects have the same direction after some time. In this article, we propose to formalise this phenomenon. Starting from the notion of propagation of defect by a cellular automaton formalized in [Piv07b, Piv07a], we show that, when iterating the automaton on a random configuration, defects in one direction only remain asymptotically.

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. Boccara, N., Nasser, J., Roger, M.: Particlelike structures and their interactions in spatiotemporal patterns generated by one-dimensional deterministic cellular-automaton rules. Phys. Rev. A 44(2), 866–875 (1991)

    Article  Google Scholar 

  2. Boyer, L., Poupet, V., Theyssier, G.: On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 190–201. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Eloranta, K.: The dynamics of defect ensembles in one-dimensional cellular automata. Journal of Statistical Physics 76, 1377–1398 (1994), doi:10.1007/BF02187067

    Article  MathSciNet  MATH  Google Scholar 

  4. Fisch, R.: The one-dimensional cyclic cellular automaton: A system with deterministic dynamics that emulates an interacting particle system with stochastic dynamics. Journal of Theoretical Probability 3, 311–338 (1990), doi:10.1007/BF01045164

    Article  MathSciNet  MATH  Google Scholar 

  5. Hanson, J.E., Crutchfield, J.P.: Computational mechanics of cellular automata: An example. Physica D: Nonlinear Phenomena 103(1-4), 169–189 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hedlund, G.A.: Endomorphisms and automorphisms of the shift dynamical system. Theory of Computing Systems 3(4), 320–375 (1969)

    MathSciNet  MATH  Google Scholar 

  7. Hurley, M.: Attractors in cellular automata. Ergodic Theory Dynam. Systems 10(1), 131–140 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hurley, M.: Ergodic aspects of cellular automata. Ergodic Theory Dynam. Systems 10(4), 671–685 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kůrka, P., Maass, A.: Limit sets of cellular automata associated to probability measures. Journal of Statistical Physics 100(5), 1031–1047 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kůrka, P.: Cellular automata with vanishing particules. Fundamenta Informaticae 58, 1–19 (2003)

    MathSciNet  Google Scholar 

  11. Pivato, M.: Defect particle kinematics in one-dimensional cellular automata. Theoretical Computer Science 377(1-3), 205–228 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Pivato, M.: Spectral domain boundaries in cellular automata. Fundamenta Informaticae 78(3), 417–447 (2007)

    MathSciNet  MATH  Google Scholar 

  13. Theyssier, G.: Captive cellular automata. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 427–438. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Walters, P.: An introduction to ergodic theory. Springer, Heidelberg (2000)

    MATH  Google Scholar 

  15. Wolfram, S.: Computation theory of cellular automata. Communications in Mathematical Physics 96(1), 15–57 (1984)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Fondamentale, Université de Provence, Marseille, France

    Benjamin Hellouin de Menibus & Mathieu Sablik

Authors
  1. Benjamin Hellouin de Menibus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mathieu Sablik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

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

    Giancarlo Mauri  & Alberto Leporati  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hellouin de Menibus, B., Sablik, M. (2011). Self-organization in Cellular Automata: A Particle-Based Approach. In: Mauri, G., Leporati, A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22321-1_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22321-1_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22320-4

  • Online ISBN: 978-3-642-22321-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation