Number-conserving cellular automaton rules

Abstract

A necessary and sufficient condition for a one-dimensional q-state n-input cellular automaton rule to be number-conserving is established. Two different forms of simpler and more visual representations of these rules are given, and their flow diagrams are determined. Various examples are presented and applications to car traffic are indicated. Two nontrivial three-state three-input self-conjugate rules have been found. They can be used to model the dynamics of random walkers.

4 figures

References in corpus (1)

• Cellular automaton rules conserving the number of active sites

Cited by in corpus (11)

• A Survey of Cellular Automata: Types, Dynamics, Non-uniformity and Applications
• Conservation Laws in Cellular Automata
• A class of cellular automata equivalent to deterministic particle systems
• Number-conserving cellular automata with a von Neumann neighborhood of range one
• A split-and-perturb decomposition of number-conserving cellular automata
• Complex dynamics emerging in Rule 30 with majority memory
• Motion representation of one-dimensional cellular automaton rules
• Explorations of ternary cellular automata and ternary density classification problems
• Deterministic cellular automata resembling diffusion
• Exact limiting solutions for certain deterministic traffic rules
• Finding The Sign Of A Function Value By Binary Cellular Automaton