Coalescing Cellular Automata - ENS de Lyon - École normale supérieure de Lyon Access content directly
Conference Papers Year : 2006

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.
Fichier principal
Vignette du fichier
main.pdf (319.11 Ko) Télécharger le fichier

Dates and versions

ensl-00103510 , version 1 (04-10-2006)



Jean-Baptiste Rouquier, Michel Morvan. Coalescing Cellular Automata. International Conference on Computational Science (ICCS 2006) : Advancing Science through Computation. Workshop "Modelling of Complex Systems by Cellular Automata" (MCSCA 2006), University of Reading, United Kingdom, May 2006, Reading, United Kingdom. pp.321-328, ⟨10.1007/11758532_44⟩. ⟨ensl-00103510⟩
228 View
116 Download



Gmail Facebook Twitter LinkedIn More