Motion representation of one-dimensional cellular automaton rules
Nino Boccara, Henryk Fuks
Abstract
Generalizing the motion representation we introduced for number-conserving rules, we give a systematic way to construct a generalized motion representation valid for non-conservative rules using the expression of the current, which appears in the discrete version of the continuity equation, completed by the discrete analogue of the source term. This new representation is general, but not unique, and can be used to represent, in a more visual way, any one-dimensional cellular automaton rule. A few illustrative examples are presented.
Create a lesson
Related papers
Computing functions through the orbits of dynamical systems: the case of cellular automata
Niccolò Castronuovo, Alberto Dennunzio, Luciano Margara
Geometry-Controlled Initial-Density Dependence in Branching-Merging Exclusion Processes
Hiroki Yamamoto, Daichi Yanagisawa, Katsuhiro Nishinari
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
Towards New Parity Rules with Asynchronous Updating Inspired by Fatès's Rule
Rolf Hoffmann
Diagonal Bases and Diagonal Periods of Elementary Cellular Automata
Tigran Nersissian