Number conserving cellular automata: form decidability to dynamics
B. Durand, E. Formenti, Z. Roka
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.
Create a lesson
Related papers
A repeating sequence of simple rules creates a universal computer
Riz Fernando Noronha
Analytical derivation of a three-dimensional fundamental diagram for a real-valued max-plus particle system
Daisuke Takahashi, Junta Matsukidaira, Kazuya Okamoto
Diagonal Bases and Diagonal Periods of Elementary Cellular Automata
Tigran Nersissian
Diagonal Periods and Newton Supports of Rules 30, 86 and 135
Tigran Nersissian
Gliders on Aperiodic Monotilings: Cellular Automata on the Hat and Spectre
James Edmond
Optical free space extreme learning machine for the implementation of emergent complex systems
Elena Moreno, Fernando Soldevila, Daniel Torrent