Skip to main content
SpringerLink
Log in

Characteristics of fractal cellular automata constructed from linear rules

  • Original Article
  • Published:
Artificial Life and Robotics Aims and scope Submit manuscript

Abstract

Cellular automata (CAs) have played a significant role in the study of complex systems. Recently, the recursive estimation of neighbors (REN) algorithm was proposed to extend a CA rule with a unit rule radius to rules with larger radii. This framework enables the construction of non-uniform CAs comprising cells that follow different CA rules. A non-uniform CA, referred to as fractal CA (F-CA), which comprises fractally arranged cells, inherits certain characteristics of basic CAs, including pattern replicability and time-reversibility of linear rules. In this paper, F-CAs based on linear rules, particularly the elementary CA #90 and #150, and life-like CA B1357S1357 and B1357S02468 are investigated. Cells in the F-CAs of #90 and B1357S1357 are separated into groups by their rule radius and each group has an independent lifetime. The explicitly constructed inverse rule of F-CA of #150 is more complex than that of F-CA. The complexity of the F-CA of B1357S02468 and its inverse CA is demonstrated by image scrambling. The F-CAs can be applied to encoding and decoding processes for encryption systems.

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
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. von Neumann J (1966) The theory of self-reproducing automata. In: Burks AW (ed) Essays on cellular automata. University of Illinois Press, Champaign

    Google Scholar 

  2. Wolfram S (1986) Theory and applications of cellular automata. World Scientific, Singapore

    MATH  Google Scholar 

  3. Hansen PB (1993) Parallel cellular automata: a model program for computational science. Concurr Pract Exp 5:425–448

    Article  Google Scholar 

  4. Ermentrout GB, Edelstein-Keshet L (1993) Cellular automata approaches to biological modelling. J Theor Biol 160:97–133

    Article  Google Scholar 

  5. Ganguly N, Sikdar BK, Deutsch A, Canright G, Chaudhuri PP (2003) A survey on cellular automata

  6. Chopard B, Droz M (2005) Cellular automata modeling of physical systems. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  7. Kayama Y (2016) Extension of cellular automata via the introduction of an algorithm for the recursive estimation of neighbors. Artif Life Robot 21(3):338–344

    Article  Google Scholar 

  8. Kayama Y (2016) Expansion of perception area in cellular automata using recursive algorithm. In: Proceeding of the fifteenth international conference on the simulation and synthesis of living systems, pp 92–99

  9. Gerald E (2004) Classics on fractals. Westview Press, Boulder

    MATH  Google Scholar 

  10. Trochet H (2009) A history of fractal geometry. University of St Andrews MacTutor History of Mathematics. http://www-groups.dcs.stand.ac.uk/~history/HistTopics/fractals.html

  11. Mandelbrot BB, Pignoni R (1983) The fractal geometry of nature, vol 173. WH Freeman, New York

    Google Scholar 

  12. Briggs J (1992) Fractals: the patterns of chaos: a new aesthetic of art, science, and nature. Simon and Schuster, New York

    Google Scholar 

  13. Falconer K (2004) Fractal geometry: mathematical foundations and applications. Wiley, Hoboken

    MATH  Google Scholar 

  14. Song C, Havlin S, Makse HA (2005) Self-similarity of complex networks. Nature 433(7024):392

    Article  Google Scholar 

  15. Kayama Y (2018) Cellular automata in fractal arrangement. Artif Life Robot 23:395–401

    Article  Google Scholar 

  16. Wolfram S (1983) Statistical mechanics of cellular automata. Rev Mod Phys 55:601–644

    Article  MathSciNet  Google Scholar 

  17. Wolfram S (2002) A new kind of science. Wolfram Media Inc, Champaign

    MATH  Google Scholar 

  18. Adamatzky A (ed) (2010) Game of life cellular automata. Springer, London

    MATH  Google Scholar 

  19. Eppstein D (2010) Growth and decay in life-like cellular automata. In: Adamatzky A (ed) Game of life cellular automata. Springer, Berlin, pp 71–98

    Chapter  Google Scholar 

  20. Kayama Y (2011) Network representation of cellular automata. In: 2011 IEEE symposium on artificial life (ALIFE), pp 194–202

  21. Fredkin E (1990) An informational process based on reversible universal cellular automata. Phys D Nonlinear Phenom 45(1–3):254–270

    Article  MathSciNet  Google Scholar 

  22. Reynolds CW (1987) Flocks, herds and schools: a distributed behavioral model. ACM Siggraph Comput Graph 21(4):25–34

    Article  Google Scholar 

  23. Kayama Y, Koda Y, Yazawa I (2018) Fractal arrangement for 2D cellular automata and its implementation for outer-totalistic rules. In: Proceedings of thirteenth International Conference on Cellular Automata for Research and Industry, Springer, pp 328–339

  24. Gardner M (1970) Mathematical games. Sci Am 223:102–123

    Article  Google Scholar 

  25. Berlekamp ER, Conway JH, Guy RK (1982) Winning ways for your mathematical plays, vol 2. AK Peters, Natick

    MATH  Google Scholar 

Download references

Acknowledgements

The author wishes to thank all the anonymous reviewers for valuable comments and suggestions. This research was supported in part by a grant from BAIKA Gakuen, Japan.

Author information

Authors and Affiliations

  1. Department of Media and Information, BAIKA Women’s University, 2-19-5 Shukuno-sho, Ibaraki, Osaka, 567-8578, Japan

    Yoshihiko Kayama

Authors
  1. Yoshihiko Kayama
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yoshihiko Kayama.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kayama, Y. Characteristics of fractal cellular automata constructed from linear rules. Artif Life Robotics 25, 8–16 (2020). https://doi.org/10.1007/s10015-019-00567-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10015-019-00567-5

Keywords

Search

Navigation