Number conserving cellular automata: form decidability to dynamics
Abstract
We compare several definitions for number-conserving cellular automata that we prove to be equivalent. A necessary and sufficient condition for to be number-conserving is proved. Using this condition, we give a linear-time algorithm to decide number-conservation. The dynamical behavior of number-conserving is studied and a classification that focuses on chaoticity is given.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.