Asymptotic Dynamics of (Some) Asyncronous Cellular Automata
Cellular automata are a well-known discrete model for complex systems characterized by local interactions. Indeed, these local interactions cause the emergence of a global complex behavior. Cellular automata essentially consist in an infinite number of identical finite automata arranged on regular grid (ℤ in this talk). Each automaton updates its state on the basis of a local rule which takes into account the state of a fixed number of neighboring automata.
KeywordsCellular Automaton Formal Language Local Interaction Finite Automaton Local Rule
- 1.Bersini, H., Detours, V.: Asynchrony induces stability in cellular automata based models. In: Proceedings of Artificial Life IV, pp. 382–387. MIT Press, Cambridge (1994)Google Scholar