Intrinsic universality of a 1-dimensional reversible cellular automaton
From MaRDI portal
Publication:5048944
Recommendations
- Simulation and intrinsic universality among reversible cellular automata, the partition cellular automata leverage
- Reversible simulation of one-dimensional irreversible cellular automata
- Developments in Language Theory
- Computation-universality of one-dimensional one-way reversible cellular automata
- Simple universal one-dimensional reversible cellular automata
Cites work
- scientific article; zbMATH DE number 3898247 (Why is no real title available?)
- scientific article; zbMATH DE number 3205673 (Why is no real title available?)
- A universal cellular automaton in quasi-linear time and its S-m-n form
- Computation and construction universality of reversible cellular automata
- Computation-universality of one-dimensional one-way reversible cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Endomorphisms and automorphisms of the shift dynamical system
- Invertible cellular automata: A review
- Logical Reversibility of Computation
- Representation of reversible cellular automata with block permutations
- Reversibility and surjectivity problems of cellular automata
- Reversibility of 2D cellular automata is undecidable
- Reversible cellular automaton able to simulate any other reversible one using partitioning automata
- Reversible simulation of one-dimensional irreversible cellular automata
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Tesselations with local transformations
Cited in
(11)- Cellular automata universality revisited
- An intrinsically universal family of causal graph dynamics
- Simulation limitations of affine cellular automata
- Reversible space-time simulation of cellular automata
- Intrinsically universal \(n\)-dimensional quantum cellular automata
- The structure of reversible one-dimensional cellular automata
- Computation-universality of one-dimensional one-way reversible cellular automata
- Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata
- The complexity of iterated reversible computation
- Selfsimilarity, simulation and spacetime symmetries
- Simulation and intrinsic universality among reversible cellular automata, the partition cellular automata leverage
This page was built for publication: Intrinsic universality of a 1-dimensional reversible cellular automaton
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048944)
