Number-Conserving Reversible Cellular Automata and Their Computation-Universality
From MaRDI portal
Publication:2773021
DOI10.1051/ita:2001118zbMath1014.68102MaRDI QIDQ2773021
Katsunobu Imai, Kenichi Morita
Publication date: 28 July 2003
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2001__35_3_239_0
68Q80: Cellular automata (computational aspects)
Related Items
Construction of One-Dimensional Nonuniform Number Conserving Elementary Cellular Automata Rules, Number-conserving cellular automata I: Decidability., On conservative and monotone one-dimensional cellular automata and their particle representation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Invertible cellular automata: A review
- Conservative logic
- Computation-universality of one-dimensional one-way reversible cellular automata
- Computation and construction universality of reversible cellular automata
- Universality of a reversible two-counter machine
- A computation-universal two-dimensional 8-state triangular reversible cellular automaton
- SAND PILE AS A UNIVERSAL COMPUTER
- Logical Reversibility of Computation