Number-conserving reversible cellular automata and their computation-universality

RAIRO - Theoretical Informatics and Applications

Volumn 35, Issue 3, 2001, Pages 239-258

  Morita, K ^a   Imai, K ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Cellular automata; Conservation law; Reversibility; Universality

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; FORMAL LOGIC;

PARTITIONED CELLULAR AUTOMATON (PCA); REVERSIBLE COMPUTATIONS;

AUTOMATA THEORY;

EID: 17944362715     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2001118     Document Type: Article

References (14)

1. A simple universal cellular automaton and its one-way and totalistic version
2. Logical reversibility of computation
3. Notes on the history of reversible computation
4. Conservative logic
5. Sand pile automata
6. Sand pile as a universal computer
7. A computation-universal two-dimensional 8-state triangular reversible cellular automaton
8. Physics-like model of computation
9. Computation universality of one-dimensional reversible (injective) cellular automata
10. Computation-universal models of two-dimensional 16-state reversible cellular automata
11. Computation-universality of one-dimensional one-way reversible cellular automata
12. Universality of a reversible two-counter machine
13. Computation and construction universality of reversible cellular automata
14. Invertible cellular automata: A review