Computation in reversible cellular automata
From MaRDI portal
Publication:2869782
DOI10.1080/03081079.2012.695897zbMath1283.68230OpenAlexW1986870597MaRDI QIDQ2869782
Publication date: 6 January 2014
Published in: International Journal of General Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081079.2012.695897
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cellular automata (computational aspects) (68Q80)
Related Items (4)
Reversibility problem of multidimensional finite cellular automata ⋮ Reversible computation in term rewriting ⋮ Small Universal Reversible Counter Machines ⋮ Reversibility of linear cellular automata on Cayley trees with periodic boundary condition
Uses Software
Cites Work
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
- Firing squad synchronization problem in reversible cellular automata
- Reversible simulation of one-dimensional irreversible cellular automata
- Invertible cellular automata: A review
- Reversible computing and cellular automata -- a survey
- Computation and construction universality of reversible cellular automata
- Reversibility and surjectivity problems of cellular automata
- A computation-universal two-dimensional 8-state triangular reversible cellular automaton
- Tesselations with local transformations
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Irreversibility and Heat Generation in the Computing Process
- Endomorphisms and automorphisms of the shift dynamical system
- Logical Reversibility of Computation
This page was built for publication: Computation in reversible cellular automata
