Graphs Related to Reversibility and Complexity in Cellular Automata
- Cellular automaton
is a discrete dynamical system composed by a finite array of cells connected locally, which update their states at the same time using the same local mapping that takes into account the closest neighbors.
- Complex automaton
is a cellular automaton characterized by generating complex structures in its spatial-temporal evolution. For instance, the formation of self-localizations or gliders.
- Cycle graph
is a directed graph in which vertices are finite configurations and edges represent the global mapping between configurations induced by the local evolution rule.
- De Bruijn graph
is a directed graph in which vertices represent partial neighborhoods and edges represent complete neighborhoods obtained by valid overlaps between vertices. Edges are labeled according to the evolution of the neighborhood.
is a complex pattern with volume, mass, period, displacement, and direction. Sometimes these nontrivial patterns are referred as particles, waves, spaceships,...
- Bang-Jensen J, Gutin GZ (2008) Digraphs: theory, algorithms and applications. Springer, LondonGoogle Scholar
- Bossomaier T, Sibley-Punnett L, Cranny T (2000) Basins of attraction and the density classification problem for cellular automata. In: International conference on virtual worlds, Springer, pp 245–255Google Scholar
- Boykett T, Kari J, Taati S (2008) Conservation laws in rectangular ca. J Cell Autom 3(2):115–122Google Scholar
- Golomb SW et al (1982) Shift register sequences. World Scientific, SingaporeGoogle Scholar
- Hopcroft JE (1979) Introduction to automata theory, languages and computation. Addison-Wesley, BostonGoogle Scholar
- Khoussainov B, Nerode A (2001) Automata theory and its applications, vol 21. Springer, New YorkGoogle Scholar
- Leon PA, Martinez GJ (2016) Describing complex dynamics in lifelike rules with de Bruijn diagrams on complex and chaotic cellular automata. J Cell Autom 11(1):91–112Google Scholar
- Martínez GJ, Adamatzky A, Chen B, Chen F, Seck JC (2017) Simple networks on complex cellular automata: from de Bruijn diagrams to jump-graphs. In: Swarm dynamics as a complex networks. Springer (To be published), pp 177–204Google Scholar
- McIntosh HV (1991) Linear cellular automata via de Bruijn diagrams. Webpage: http://delta.cs.cinvestav.mx/~mcintosh
- McIntosh HV (2009) One dimensional cellular automata. Luniver Press, United KingdomGoogle Scholar
- McIntosh HV (2010) Life’s still lifes. In: Game of life cellular automata. Springer, London, pp 35–50Google Scholar
- Mortveit H, Reidys C (2007) An introduction to sequential dynamical systems. Springer, New YorkGoogle Scholar
- Pei Y, Han Q, Liu C, Tang D, Huang J (2014) Chaotic behaviors of symbolic dynamics about rule 58 in cellular automata. Math Probl Eng 2014:Article ID 834268, 9 pagesGoogle Scholar
- Sakarovitch J (2009) Elements of automata theory. Cambridge University Press, New YorkGoogle Scholar
- Seck-Tuoh-Mora JC, Hernández MG, Chapa Vergara SV (2008) Pair diagram and cyclic properties characterizing the inverse of reversible automata. J Cell Autom 3(3):205–218Google Scholar
- Voorhees B (2006) Discrete baker transformation for binary valued cylindrical cellular automata. In: International conference on cellular automata, Springer, pp 182–191Google Scholar
- Wuensche A (2005) Discrete dynamics lab: tools for investigating cellular automata and discrete dynamical networks, updated for multi-value, section 23, chain rules and encryption. In: Adamatzky A, Komosinski M (eds) Artificial life models in software, Springer-Verlag, London, pp 263–297Google Scholar
- Wuensche A, Lesser M (1992) The global dynamics of cellular automata: an atlas of basin of attraction fields of one-dimensional cellular automata. Addison-Wesley, BostonGoogle Scholar
- Zamora RR, Vergara SVC (2004) Using de Bruijn diagrams to analyze 1d cellular automata traffic models. In: International conference on cellular automata, Springer, pp 306–315Google Scholar