Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage

DOI10.1007/978-3-319-73216-9_4zbMath1434.68312OpenAlexW2788305499MaRDI QIDQ5112164

Jérôme O. Durand-Lose

Publication date: 28 May 2020

Published in: Reversibility and Universality (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-73216-9_4

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reversible simulation of one-dimensional irreversible cellular automata
• Reversibility of 2D cellular automata is undecidable
• Invertible cellular automata: A review
• Reversible computing and cellular automata -- a survey
• Computation-universality of one-dimensional one-way reversible cellular automata
• Computation and construction universality of reversible cellular automata
• A universal cellular automaton in quasi-linear time and its S-m-n form
• Reversibility and surjectivity problems of cellular automata
• Reversible space-time simulation of cellular automata
• Theory of cellular automata: a survey
• Tesselations with local transformations
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• Handbook of Natural Computing
• Representation of reversible cellular automata with block permutations
• Intrinsic universality of a 1-dimensional reversible Cellular Automaton
• Reversible cellular automaton able to simulate any other reversible one using partitioning automata
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• Endomorphisms and automorphisms of the shift dynamical system
• Logical Reversibility of Computation

This page was built for publication: Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage