Computation-universality of one-dimensional one-way reversible cellular automata
From MaRDI portal
Publication:1198089
DOI10.1016/0020-0190(92)90231-JzbMath0779.68064OpenAlexW2018470239MaRDI QIDQ1198089
Publication date: 16 January 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(92)90231-j
reversible cellular automatacomputation-universalitypartitioned cellcular automatonthree neighbor-RPCAtwo-neighbor RCA
Related Items (18)
The complexity of reversible cellular automata ⋮ How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme ⋮ Intrinsic universality of a 1-dimensional reversible Cellular Automaton ⋮ Real-time reversible iterative arrays ⋮ Self-reproduction in a reversible cellular space ⋮ Inverse rules of ECA with rule number 150 ⋮ Partial Reversibility of One-Dimensional Cellular Automata ⋮ Reversible cellular automaton able to simulate any other reversible one using partitioning automata ⋮ Block Representation of Reversible Causal Graph Dynamics ⋮ Towards a taxonomy for reversible computation approaches ⋮ Abelian Invertible Automata ⋮ Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage ⋮ Reversible simulation of one-dimensional irreversible cellular automata ⋮ Fast reversible language recognition using cellular automata ⋮ Reversibility of linear cellular automata ⋮ Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata ⋮ Number-Conserving Reversible Cellular Automata and Their Computation-Universality ⋮ Reversible space-time simulation of cellular automata
Cites Work
This page was built for publication: Computation-universality of one-dimensional one-way reversible cellular automata
