Reversible cellular automaton able to simulate any other reversible one using partitioning automata
From MaRDI portal
Publication:5096335
DOI10.1007/3-540-59175-3_92zbMath1495.68147MaRDI QIDQ5096335
Publication date: 16 August 2022
Published in: LATIN '95: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59175-3_92
68Q80: Cellular automata (computational aspects)
Related Items
Intrinsic universality of a 1-dimensional reversible Cellular Automaton, Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage, Reversible space-time simulation of cellular automata, Intrinsically universal \(n\)-dimensional quantum cellular automata, How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme
Cites Work
- Unnamed Item
- Unnamed Item
- Reversibility of 2D cellular automata is undecidable
- Invertible cellular automata: A review
- Conservative logic
- Computation-universality of one-dimensional one-way reversible cellular automata
- Computation and construction universality of reversible cellular automata
- Tesselations with local transformations
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem