Coalescing Cellular Automata

Simple item page
dc.creatorRouquier, Jean-Baptiste
dc.creatorMorvan, Michel
dc.date2006-10-04
dc.date.accessioned2026-07-07T07:29:42Z
dc.date.available2026-07-07T07:29:42Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/nlin/0610009
dc.identifierhttp://arxiv.org/abs/nlin/0610009
dc.identifierComputational Science - ICCS 2006 6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part III (10/05/2006)
dc.identifierdoi:10.1007/11758532_44
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/118211
dc.subjectCellular Automata and Lattice Gases
dc.titleCoalescing Cellular Automata
dc.typetext

Files

Collections

arXiv