Coalescing Cellular Automata

Details Coalescing Cellular Automata Coalescing Cellular Automata

2006-10-04

arxiv.org/abs/nlin/0610009v1

Computational Science - ICCS 2006 6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part III (10/05/200

Nonlinear Sciences

Cellular Automata and Lattice Gases

Scientific paper

10.1007/11758532_44

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.

Affiliated with

Also associated with

No associations

Rating

Coalescing Cellular Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Coalescing Cellular Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coalescing Cellular Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-156046