Sciweavers

LATIN
1995
Springer
14 years 3 months ago
Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata
Partitioning automata (PA) are de ned. They are equivalent to cellular automata (CA). Reversible sub-classes are also equivalent. A simple, reversible and universal partitioning au...
Jérôme Olivier Durand-Lose