Skip to main content
SpringerLink
Log in

Cell state change dynamics in cellular automata

  • Regular Research Paper
  • Published:
Memetic Computing Aims and scope Submit manuscript

Abstract

Cellular automata are discrete dynamical systems having the ability to generate highly complex behaviour starting from a simple initial configuration and set of update rules. The discovery of rules exhibiting a high degree of global self-organization is of major importance in the study and understanding of complex systems. This task is not easily achieved since coordinated global information processing must rise from the interactions of simple components with local information and communication. In this paper, a fast supporting heuristic of linear complexity is proposed to encourage the development of rules characterized by increased dynamics with regard to cell state changes. This heuristic is integrated in an evolutionary approach to the density classification task. Computational experiments emphasize the ability of the proposed approach to facilitate an efficient exploration of the search space leading to the discovery of complex rules situated beyond the simple block-expanding rules.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Andre D, Bennett FH III, Koza JR (1996) Discovery by genetic programming of a cellular automata rule that is better than any known rule for the majority classification problem. In: Proceedings of the first annual conference on genetic programming, GECCO ’96. MIT Press, Cambridge, pp 3–11

  2. Das R, Mitchell M, Crutchfield JP (1994) A genetic algorithm discovers particle-based computation in cellular automata. In: Parallel problem solving from nature conference (PPSN-III). Springer, Berlin, pp 344–353

  3. de Oliveira PPB, Bortot JC, Oliveira G (2006) The best currently known class of dynamically equivalent cellular automata rules for density classification. Neurocomputing 70(1–3):35–43

    Google Scholar 

  4. Ferreira C (2001) Gene expression programming: a new adaptive algorithm for solving problems. Complex Syst 13(2):87–129

    MATH  Google Scholar 

  5. Gacs P, Kurdyumov GL, Levin LA (1978) One-dimensional uniform arrays that wash out finite islands. Probl Perdachi Inform 14:92–98

    Google Scholar 

  6. Gog A, Chira C (2009) Cellular automata rule detection using circular asynchronous evolutionary search, HAIS 2009. LNCS 5572:261–268

    Google Scholar 

  7. Iclanzan D, Gog A, Chira C (2011) Enhancing the computational mechanics of cellular automata. In: Pelta DA et al. (eds) NICSO, SCI 387, pp 267–283

  8. Juille H, Pollack JB (1998) Coevolving the ideal trainer: application to the discovery of cellular automata rules. University of Wisconsin. In: Koza JR, Banzhaf W, Chellapilla K, Deb K, Dorigo M, Fogel DB, Garzon MH, Goldberg DE, Iba H, Riolo R (eds) Genetic programming 1998: proceedings of the third annual conference. Morgan Kaufmann, Madison, pp 519–527

  9. Juille H, Pollack JB (1998) Coevolutionary learning: a case study. In: Proceedings of 15th international conference on machine learning. Morgan Kaufmann, San Francisco, pp 251–259

  10. Juille H, Pollack JB (2000) Coevolutionary learning and the design of complex systems. Adv Complex Syst 2(4):371–394

    Google Scholar 

  11. Koza JR (1992) Genetic programming: on the programming of computers by means of natural selection. MIT Press, Cambridge

    MATH  Google Scholar 

  12. Land M, Belew RK (1995) No perfect two-state cellular automata for density classification exists. Phys Rev Lett 74(25):5148–5150

    Article  Google Scholar 

  13. Mariano AS, de Oliveira GMB (2008) Evolving one-dimensional radius-2 cellular automata rules for the synchronization task. In: AUTOMATA-2008 theory and applications of cellular automata. Luniver Press, pp 514–526

  14. Mitchell M, Hraber PT, Crutchfield JP (1993) Revisiting the edge of chaos: evolving cellular automata to perform computations. Complex Syst 7:89–130

    MATH  Google Scholar 

  15. Mitchell M, Crutchfield JP, Das R (1993) Evolving cellular automata with genetic algorithms: a review of recent work. In: Proceedings of the first international conference on evolutionary computation and its applications (EvCA’96). Russian Academy of Sciences

  16. Mitchell M, Thomure MD, Williams NL (2006) The role of space in the success of coevolutionary learning. In: Proceedings of ALIFE X—the tenth international conference on the simulation and synthesis of living systems

  17. Jiménez Morales F, Crutchfield JP, Mitchell M (2001) Evolving two-dimensional cellular automata to perform density classification: a report on work in progress. Parallel Comput 27:571–585

  18. Oliveira GMB, Martins LGA, de Carvalho LB, Fynn E (2009) Some investigations about synchronization and density classification tasks in one-dimensional and two-dimensional cellular automata rule spaces. Electron Notes Theor Comput Sci 252:121–142

    Article  Google Scholar 

  19. Packard NH (1988) Adaptation toward the edge of chaos. In: Dynamic Patterns in Complex Systems. World Scientific, Singapore, pp 293–301

  20. Pagie L, Mitchell M (2002) A comparison of evolutionary and coevolutionary search. Int J Comput Intell Appl 2(1):53–69

    Article  Google Scholar 

  21. Wolz D, de Oliveira PPB (2008) Very effective evolutionary techniques for searching cellular automata rule spaces. J Cellular Automata 3:289–312

    MATH  Google Scholar 

  22. Wolfram S (ed) (1986) Theory and applications of cellular automata. In: Advanced series on complex systems, vol 1. World Scientific Publishing, Singapore

  23. Wolfram S (1984) Computation theory of cellular automata. Commun Math Phys 96(1):15–57

    Article  MathSciNet  MATH  Google Scholar 

  24. Crutchfield J, Mitchell M (1995) The evolution of emergent computation. Proc Natl Acad Sci 92(23):10742

    Article  MATH  Google Scholar 

Download references

Acknowledgments

This research is supported by Grant PN II TE 320, ”Emergence, auto-organization and evolution: New computational models in the study of complex systems”, funded by CNCS Romania. David Iclănzan acknowledges the financial support of the Sectoral Operational Program for Human Resources Development 2007–2013, co-financed by the European Social Fund, within the project POSDRU 89/1.5/S/60189 with the title ”Postdoctoral Programs for Sustainable Development in a Knowledge Based Society” and the support of Sapientia Institute for Research Programs (KPI).

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Sapientia Hungarian University of Transylvania, CP 4, OP 9, 540485 , Tg-Mureş, Romania

    David Iclănzan

  2. Department of Computer Science, Babeş-Bolyai University, Kogălniceanu, 1, 400084 , Cluj-Napoca, Romania

    Anca Gog & Camelia Chira

Authors
  1. David Iclănzan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anca Gog
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Camelia Chira
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Camelia Chira.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Iclănzan, D., Gog, A. & Chira, C. Cell state change dynamics in cellular automata. Memetic Comp. 5, 131–139 (2013). https://doi.org/10.1007/s12293-012-0093-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12293-012-0093-z

Keywords

Search

Navigation