Reversible space-time simulation of cellular automata
From MaRDI portal
Publication:1583597
DOI10.1016/S0304-3975(99)00075-4zbMATH Open0971.68110WikidataQ127983135 ScholiaQ127983135MaRDI QIDQ1583597FDOQ1583597
Publication date: 31 October 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- Reversible simulation of one-dimensional irreversible cellular automata
- scientific article; zbMATH DE number 1741020
- Reversible cellular automaton able to simulate any other reversible one using partitioning automata
- Simulation and intrinsic universality among reversible cellular automata, the partition cellular automata leverage
- scientific article
Cites Work
- Endomorphisms and automorphisms of the shift dynamical system
- Computations on one-dimensional cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Tesselations with local transformations
- Title not available (Why is that?)
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Reversibility of 2D cellular automata is undecidable
- Computation and construction universality of reversible cellular automata
- Computation-universality of one-dimensional one-way reversible cellular automata
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
- Reversible simulation of one-dimensional irreversible cellular automata
- Linear speed-up for cellular automata synchronizers and applications
- Intrinsic universality of a 1-dimensional reversible Cellular Automaton
- Reversible cellular automaton able to simulate any other reversible one using partitioning automata
Cited In (10)
- Mathematical Foundations of Computer Science 2004
- Towards intrinsically universal asynchronous CA
- How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme
- Changing Neighborhoods of CA: Reduced Local Structures and Embeddings for Universality
- Title not available (Why is that?)
- Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata
- Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage
- On fungal automata
- Simulation limitations of affine cellular automata
- Computational universality of fungal sandpile automata
This page was built for publication: Reversible space-time simulation of cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583597)
