Reversible simulation of one-dimensional irreversible cellular automata

DOI10.1016/0304-3975(95)00038-XMaRDI QIDQ672388zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Kenichi Morita

Publication date 28 February 1997

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

Full work available at URL https://doi.org/10.1016/0304-3975(95)00038-x

zbMATH Keywords

cellular automaton

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• Reversible space-time simulation of cellular automata
• Intrinsic universality of a 1-dimensional reversible cellular automaton
• Developments in Language Theory
• Simulation and intrinsic universality among reversible cellular automata, the partition cellular automata leverage

Cites work

• Computation and construction universality of reversible cellular automata
• Computation-universality of one-dimensional one-way reversible cellular automata
• Conservative logic
• scientific article; zbMATH DE number 3898247 (Why is no real title available?)
• Logical Reversibility of Computation

Cited in

(32)

• The structure of reversible one-dimensional cellular automata
• Computation-universality of one-dimensional one-way reversible 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
• Selfsimilarity, simulation and spacetime symmetries
• scientific article; zbMATH DE number 1189123 (Why is no real title available?)
• scientific article; zbMATH DE number 1339963 (Why is no real title available?)
• HOW TO SIMULATE TURING MACHINES BY INVERTIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA
• Intrinsic universality of a 1-dimensional reversible cellular automaton
• Reversible cellular automaton able to simulate any other reversible one using partitioning automata
• Simulation and intrinsic universality among reversible cellular automata, the partition cellular automata leverage
• Simple block-substitution rule exhibits interesting patterns
• Developments in Language Theory
• Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
• A survey of cellular automata: types, dynamics, non-uniformity and applications
• Reversible Top-Down Syntax Analysis
• Reversible computations of one-way counter automata
• The complexity of iterated reversible computation
• Reversible top-down syntax analysis
• Real-time reversible iterative arrays
• Fast reversible language recognition using cellular automata

This page was built for publication: Reversible simulation of one-dimensional irreversible cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672388)