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 automaton is described. Finally, it is shown that there are reversible PA and CA that are able to simulate any reversible PA or CA on any con guration.

• Type: Conference
• Year: 1995
• Where: LATIN
• Authors: Jérôme Olivier Durand-Lose
• Keywords: Information Management, LATIN 1995, Reversible Pa, Reversible Sub-classes