Coalescing Cellular Automata

DOI10.1007/11758532_44MaRDI QIDQ5503230zbMATH OpenOpenAlexFDO

Authors Jean-Baptiste Rouquier, M. Morvan

Publication date 13 January 2009

Published in Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/nlin/0610009

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)

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.

Recommendations

• Coalescing cellular automata: synchronization by common random source for asynchronous updating
• Self-organisation in cellular automata with coalescent particles: qualitative and quantitative approaches
• Phase Transitions of Cellular Automata
• Convergence of asynchronous cellular automata: does size matter?
• Directed Percolation Arising in Stochastic Cellular Automata Analysis

Cited in

(5)

• Self-organisation in cellular automata with coalescent particles: qualitative and quantitative approaches
• Coexistence of dynamics for two-dimensional cellular automata
• Coalescing cellular automata: synchronization by common random source for asynchronous updating
• scientific article; zbMATH DE number 4074494 (Why is no real title available?)
• System Reduction: An Approach Based on Probabilistic Cellular Automata

This page was built for publication: Coalescing Cellular Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5503230)