2001/02/27 by B. Durand, Bruno Durand, E. Formenti +6
Computer Science · Mathematics · Physics and Astronomy · #Cellular Automata and Applications #Cellular Automata and Lattice Gases (nlin.CG) #Computability, Logic, AI Algorithms #FOS: Physical sciences #Mathematical Dynamics and Fractals #nlin.CG
paper · pdf · doi:10.48550/arxiv.nlin/0102035
24 pages, 2 figures
arxiv created 2001/02/27 · openalex publication_date 2001/02/27 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We compare several definitions for number-conserving cellular automata that we prove to be equivalent. A necessary and sufficient condition for \cas 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 \cas is studied and a classification that focuses on chaoticity is given.