Reversible simulation of one-dimensional irreversible cellular automata

DOI10.1016/0304-3975(95)00038-XzbMath0873.68141WikidataQ56621454 ScholiaQ56621454MaRDI QIDQ672388

Kenichi Morita

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

cellular automaton

Mathematics Subject Classification ID

68Q80: Cellular automata (computational aspects)

Related Items

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, 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, 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

Cites Work

• Unnamed Item
• Conservative logic
• Computation-universality of one-dimensional one-way reversible cellular automata
• Computation and construction universality of reversible cellular automata
• Logical Reversibility of Computation