Coalescing Cellular Automata

Abstract : 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.
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download
Contributor : Jean-Baptiste Rouquier <>
Submitted on : Wednesday, October 4, 2006 - 3:36:27 PM
Last modification on : Tuesday, April 24, 2018 - 1:52:21 PM
Long-term archiving on : Tuesday, April 6, 2010 - 6:10:43 PM





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⟩



Record views


Files downloads