Number conserving cellular automata II: dynamics
✍ Scribed by Enrico Formenti; Aristide Grange
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 474 KB
- Volume
- 304
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
In this second part, we study the dynamics of the number conserving cellular automata. We give a classiÿcation which focuses on pattern divergence and chaoticity. Moreover we prove that in the case of number-conserving cellular automata, surjectivity is equivalent to regularity. As a byproduct we obtain a strong characterization of the class of cellular automata with bounded evolutions on ÿnite conÿgurations.
📜 SIMILAR VOLUMES
Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the deÿnition of the property to include cellular automata with any set
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
This paper proposes a class of two-dimensional asynchronous cellular automata with conservation of mass, for the formation of patterns in groups, and describes the merits given by this methodology. A cellular automaton rule causing a specified kind of pattern was designed manually. Thanks to this re