Coalescing Cellular Automata

  • Jean-Baptiste Rouquier
  • Michel Morvan
Conference paper

DOI: 10.1007/11758532_44

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3993)
Cite this paper as:
Rouquier JB., Morvan M. (2006) Coalescing Cellular Automata. In: Alexandrov V.N., van Albada G.D., Sloot P.M.A., Dongarra J. (eds) Computational Science – ICCS 2006. ICCS 2006. Lecture Notes in Computer Science, vol 3993. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jean-Baptiste Rouquier
    • 1
  • Michel Morvan
    • 1
    • 2
  1. 1.ENS Lyon, LIPLyonFrance
  2. 2.EHESS and Santa Fe Institute 

Personalised recommendations