arXiv · adap-org/9905004
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Nino Boccara, Henryk Fuks. 2000-05-17. Number-conserving cellular automaton rules. https://arxiv.org/abs/adap-org/9905004
Cite the original work for its findings. Save a collection to share your selection of sources.