Reversible space-time simulation of cellular automata
From MaRDI portal
Publication:1583597
DOI10.1016/S0304-3975(99)00075-4zbMath0971.68110WikidataQ127983135 ScholiaQ127983135MaRDI QIDQ1583597
Publication date: 31 October 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (7)
Towards intrinsically universal asynchronous CA ⋮ How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme ⋮ Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata ⋮ Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage ⋮ Computational universality of fungal sandpile automata ⋮ Changing Neighborhoods of CA: Reduced Local Structures and Embeddings for Universality ⋮ On fungal automata
Cites Work
- Unnamed Item
- Reversible simulation of one-dimensional irreversible cellular automata
- Reversibility of 2D cellular automata is undecidable
- Computation-universality of one-dimensional one-way reversible cellular automata
- Computation and construction universality of reversible cellular automata
- Linear speed-up for cellular automata synchronizers and applications
- Computations on one-dimensional cellular automata
- Tesselations with local transformations
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- 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
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
- Endomorphisms and automorphisms of the shift dynamical system
This page was built for publication: Reversible space-time simulation of cellular automata
