Reversible cellular automaton able to simulate any other reversible one using partitioning automata

DOI10.1007/3-540-59175-3_92zbMath1495.68147OpenAlexW1766924531MaRDI QIDQ5096335

Jérôme O. Durand-Lose

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

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (5)

How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme ⋮ Intrinsic universality of a 1-dimensional reversible Cellular Automaton ⋮ Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage ⋮ Intrinsically universal \(n\)-dimensional quantum cellular automata ⋮ Reversible space-time simulation of cellular automata

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Reversible cellular automaton able to simulate any other reversible one using partitioning automata