Coalescing Cellular Automata -- Synchronizing CA by Common Random Source and Varying Asynchronicity

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, non coalescence for two other, 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

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00196635
Contributor : Jean-Baptiste Rouquier <>
Submitted on : Thursday, December 13, 2007 - 11:06:16 AM
Last modification on : Wednesday, January 23, 2019 - 7:48:08 PM

Links full text

Identifiers

  • HAL Id : ensl-00196635, version 1
  • ARXIV : 0712.1992

Citation

Jean-Baptiste Rouquier, Michel Morvan. Coalescing Cellular Automata -- Synchronizing CA by Common Random Source and Varying Asynchronicity. 2007. ⟨ensl-00196635⟩

Share

Metrics

Record views

620