Reversibility of number-conserving 1D cellular automata: unlocking insights into the dynamics for larger state sets
From MaRDI portal
Publication:2077834
DOI10.1016/j.physd.2021.133075zbMath1492.37018OpenAlexW3208503416MaRDI QIDQ2077834
Barbara Wolnik, Adam Dzedzej, Maciej Dziemiańczuk, Bernard De Baets
Publication date: 22 February 2022
Published in: Physica D (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physd.2021.133075
Related Items (1)
Cites Work
- Reversibility of linear cellular automata
- Reversibility of 2D cellular automata is undecidable
- Invertible cellular automata: A review
- Linear cellular automata over \(Z_ m\)
- Global properties of cellular automata
- On reversibility in cellular automata
- Invertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspects
- Inversion of 2D cellular automata: Some complexity results
- Additive cellular automata and global injectivity
- Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions
- Number-conserving cellular automata I: Decidability.
- A closed formula for the inverse of a reversible cellular automaton with \((2 R + 1)\)-cyclic rule
- A split-and-perturb decomposition of number-conserving cellular automata
- Efficient enumeration of three-state two-dimensional number-conserving cellular automata
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- Tesselations with local transformations
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Ternary reversible number-conserving cellular automata are trivial
- A two-layer representation of four-state reversible number-conserving 2D cellular automata
- Periodicity and Immortality in Reversible Computing
- Matrix methods and local properties of reversible one-dimensional cellular automata
- Cellular automata approach to three-phase traffic theory
- Twenty Problems in the Theory of Cellular Automata
- On Radius 1 Nontrivial Reversible and Number-Conserving Cellular Automata
- Developments in Language Theory
- Endomorphisms and automorphisms of the shift dynamical system
- Automata, Languages and Programming
- A cellular automaton model for two-lane traffic.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Reversibility of number-conserving 1D cellular automata: unlocking insights into the dynamics for larger state sets
