Reversible simulation of one-dimensional irreversible cellular automata
From MaRDI portal
Publication:672388
DOI10.1016/0304-3975(95)00038-XzbMath0873.68141WikidataQ56621454 ScholiaQ56621454MaRDI QIDQ672388
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q80: Cellular automata (computational aspects)
Related Items
Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage, Simple Block-Substitution Rule Exhibits Interesting Patterns, Reversible top-down syntax analysis, Real-time reversible iterative arrays, Fast reversible language recognition using cellular automata, Self-reproduction in a reversible cellular space, Reversible space-time simulation of cellular automata, Reversible computation in term rewriting, Intrinsically universal \(n\)-dimensional quantum cellular automata, Partitioned quantum cellular automata are intrinsically universal, How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme, Reversible parallel communicating finite automata systems, A single-copy minimal-time simulation of a torus of automata by a ring of automata, Computation in reversible cellular automata, Aspects of Reversibility for Classical Automata, Reversible and Irreversible Computations of Deterministic Finite-State Devices, When input-driven pushdown automata meet reversiblity, Reversible Causal Graph Dynamics
Cites Work