Coalescing Cellular Automata
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both configurations become identical after a reasonable time. We prove coalescence for two elementary rules and show that there exists infinitely many coalescing CA. We then conduct an experimental study on all elementary CA and show that some rules exhibit a phase transition, which belongs to the universality class of directed percolation.
Unable to display preview. Download preview PDF.
- 1.Fatès, N., Morvan, M.: An experimental study of robustness to asynchronism for elementary cellular automata. Complex Systems 16 (2005) (to appear)Google Scholar
- 3.Fates, N., Regnault, D., Schabanel, N., Thierry, E.: Asynchronous behavior of double-quiescent elementary cellular automata. In: LATIN (2006) (to appear)Google Scholar
- 4.Hinrichsen, H.: Nonequilibrium critical phenomena and phase transitions into absorbing states. Advances in Physics, 815 (2000)Google Scholar