A class of cellular automata equivalent to deterministic particle systems

Abstract

We demonstrate that a local mapping f in a space of bisequences over {0,1} which conserves the number of nonzero sites can be viewed as a deterministic particle system evolving according to a local mapping in a space of increasing bisequences over Z. We present an algorithm for determination of the local mapping in the space of particle coordinates corresponding to the local mapping f.

14 pages

Cited by in corpus (7)

• Convergence to equilibrium in a class of interacting particle systems evolving in discrete time
• Critical behavior of number-conserving cellular automata with nonlinear fundamental diagrams
• Enumeration of number-conserving cellular automata rules with two inputs
• Second order additive invariants in elementary cellular automata
• Number Conservation via Particle Flow in One-dimensional Cellular Automata
• Dynamics of the Cellular Automaton Rule 142
• On Conservative and Monotone One-dimensional Cellular Automata and Their Particle Representation