On the hierarchy of conservation laws in a cellular automaton
From MaRDI portal
Publication:1761692
DOI10.1007/s11047-010-9222-0zbMath1251.68148OpenAlexW2014138451WikidataQ62045927 ScholiaQ62045927MaRDI QIDQ1761692
Siamak Taati, Enrico Formenti, Jarkko Kari
Publication date: 15 November 2012
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-010-9222-0
Related Items (8)
Statistical Equilibrium in Deterministic Cellular Automata ⋮ A gauge invariant reversible cellular automaton ⋮ Statistical mechanics of surjective cellular automata ⋮ Efficient enumeration of three-state two-dimensional number-conserving cellular automata ⋮ Three research directions in non-uniform cellular automata ⋮ Dynamical behavior of additive cellular automata over finite abelian groups ⋮ Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties ⋮ Decidability and undecidability in cellular automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Additive conserved quantities in discrete-time lattice dynamical systems
- Lyapunov exponent versus expansivity and sensitivity in cellular automata
- Reversibility and surjectivity problems of cellular automata
- Number conserving cellular automata. II: Dynamics.
- Theory of cellular automata: a survey
- Tiling with polyominoes and combinatorial group theory
- On the presence of periodic configurations in Turing machines and in counter machines.
- Number-conserving cellular automata I: Decidability.
- On conservative and monotone one-dimensional cellular automata and their particle representation
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- Some algorithmic problems for finitely defined commutative semigroups
- Conway's Tiling Groups
- Invariant in cellular automata
- The Most General Conservation Law for a Cellular Automaton
- Cellular automaton rules conserving the number of active sites
- Languages, equicontinuity and attractors in cellular automata
- Textile systems for endomorphisms and automorphisms of the shift
- Conservation laws in cellular automata
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Endomorphisms and automorphisms of the shift dynamical system
This page was built for publication: On the hierarchy of conservation laws in a cellular automaton
