We numerically study the dynamics of elementary 1D cellular automata (CA), where the binary state s i Γ°tΓ 2 f0; 1g of a cell i does not only depend on the states in its local neighborhood at time t Γ 1, but also on the memory of its own past states s i Γ°t Γ 2Γ; s i Γ°t Γ 3Γ; . . . ; s i Γ°t Γ tΓ; . .
Investigating topological chaos by elementary cellular automata dynamics
β Scribed by Gianpiero Cattaneo; Michele Finelli; Luciano Margara
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 171 KB
- Volume
- 244
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
β¦ Synopsis
We apply the two di erent deΓΏnitions of chaos given by Devaney and by Knudsen for general discrete time dynamical systems (DTDS) to the case of elementary cellular automata, i.e., 1-dimensional binary cellular automata with radius 1. A DTDS is chaotic according to the Devaney's deΓΏnition of chaos i it is topologically transitive, has dense periodic orbits, and it is sensitive to initial conditions. A DTDS is chaotic according to the Knudsen's deΓΏnition of chaos i it has a dense orbit and it is sensitive to initial conditions. We enucleate an easy-to-check property (left or rightmost permutivity) of the local rule associated with a cellular automaton which is a su cient condition for D-chaotic behavior. It turns out that this property is also necessary for the class of elementary cellular automata. Finally, we prove that the above mentioned property does not remain a necessary condition for chaoticity in the case of non elementary cellular automata.
π SIMILAR VOLUMES