Computation-universality of one-dimensional one-way reversible cellular automata
From MaRDI portal
Publication:1198089
DOI10.1016/0020-0190(92)90231-JzbMATH Open0779.68064OpenAlexW2018470239MaRDI QIDQ1198089FDOQ1198089
Authors: Kenichi Morita 
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
Recommendations
- Universality of one-dimensional reversible and number-conserving cellular automata
- Simple universal one-dimensional reversible cellular automata
- Intrinsic universality of a 1-dimensional reversible cellular automaton
- scientific article; zbMATH DE number 4195207
- Achieving universal computations on one-dimensional cellular automata
- Partial reversibility of one-dimensional cellular automata
- The structure of reversible one-dimensional cellular automata
- Reversible simulation of one-dimensional irreversible cellular automata
- Computation in reversible cellular automata
- Procedures for calculating reversible one-dimensional cellular automata
reversible cellular automatacomputation-universalitypartitioned cellcular automatonthree neighbor-RPCAtwo-neighbor RCA
Cites Work
Cited In (26)
- Title not available (Why is that?)
- Real-time reversible iterative arrays
- Fast reversible language recognition using cellular automata
- Block representation of reversible causal graph dynamics
- Reversibility of linear cellular automata
- Towards a taxonomy for reversible computation approaches
- Computation in reversible cellular automata
- Abelian Invertible Automata
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
- Hybrid one-dimensional reversible cellular automata are regular
- Simulation and intrinsic universality among reversible cellular automata, the partition cellular automata leverage
- Self-reproduction in a reversible cellular space
- Number-conserving reversible cellular automata and their computation-universality
- How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme
- Reversible space-time simulation of cellular automata
- Partial reversibility of one-dimensional cellular automata
- Simple universal one-dimensional reversible cellular automata
- Inverse rules of ECA with rule number 150
- The complexity of reversible cellular automata
- The structure of reversible one-dimensional cellular automata
- Reversible cellular automaton able to simulate any other reversible one using partitioning automata
- Intrinsic universality of a 1-dimensional reversible cellular automaton
- Title not available (Why is that?)
- Developments in Language Theory
- Universality of one-dimensional reversible and number-conserving cellular automata
- Reversible simulation of one-dimensional irreversible cellular automata
This page was built for publication: Computation-universality of one-dimensional one-way reversible cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198089)
