International Journal of Bifurcation and Chaos · 2007 · 32 citations · 8 references
Natural SciencesMathematicsComplex SystemsDynamical SystemsTopologyAutomata TheoryCellular AutomataDiscrete Dynamical SystemsFinite AutomataSymbolic DynamicsCellular Automata ClassificationCellular Automata RulesEquivalence ClassesInfinite SequencesOne-dimensional Cellular AutomataSymbolic AutomataTopological Conjugacy
We establish the relation between the extended (i.e. I = ∞) one-dimensional binary Cellular Automata (1D CA) and the bi-infinite symbolic sequences in symbolic dynamics. That is, the 256 local rules of 1D CA correspond to 256 local rule mappings in the symbolic space. By employing the two homeomorphisms T † and [Formula: see text] from [Chua et al., 2004] for finite I, we classify these 256 local rule mappings into the same 88 equivalence classes identified in [Chua et al., 2004] and [Chua, 2006]. Different mappings in the same equivalence class are mutually topologically conjugate.
8
Theory of Self-Reproducing Automata
Jacob T. Schwartz, John von Neumann, Arthur W. Burks · Mathematics of Computation · 1967 · 5.5K citations
Universality and complexity in cellular automata
Stephen Wolfram · Physica D Nonlinear Phenomena · 1984 · 1.9K citations
Computing, Mathematics, Algorithms +11