Simple universal one-dimensional reversible cellular automata
From MaRDI portal
Recommendations
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
- Computation-universality of one-dimensional one-way reversible cellular automata
- scientific article; zbMATH DE number 4070331
- Computation in reversible cellular automata
- Developments in Language Theory
Cited in
(19)- The structure of reversible one-dimensional cellular automata
- Computation-universality of one-dimensional one-way reversible cellular automata
- Some results on cellular automata
- A computation-universal two-dimensional 8-state triangular reversible cellular automaton
- Sequential and maximally parallel multiset rewriting: reversibility and determinism
- A one-dimensional physically universal cellular automaton
- Hybrid one-dimensional reversible cellular automata are regular
- scientific article; zbMATH DE number 5895986 (Why is no real title available?)
- scientific article; zbMATH DE number 4070331 (Why is no real title available?)
- scientific article; zbMATH DE number 1490015 (Why is no real title available?)
- Universality of Reversible Hexagonal Cellular Automata
- Universality of one-dimensional reversible and number-conserving cellular automata
- Intrinsic universality of a 1-dimensional reversible cellular automaton
- Logical gates via gliders collisions
- scientific article; zbMATH DE number 6255722 (Why is no real title available?)
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
- A universal cellular automaton without sensitive subsystems
- The complexity of iterated reversible computation
- Reversible computing and cellular automata -- a survey
This page was built for publication: Simple universal one-dimensional reversible cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5446408)
