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 arid show that some rules exhibit a phase transition, which belongs to the universality cliiss of directed percolation. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Rouquier, J. B., & Morvan, M. (2006). Coalescing cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3993 LNCS-III, pp. 321–328). Springer Verlag. https://doi.org/10.1007/11758532_44
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
