Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata

Jérôme Durand-Lose (1)

1 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans

Partitioning automata (PA) are defined. 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 configuration. The resutls work in dimention 2 and above.

Mots clés: Block Cellular Automata; Cellular Automata; Partitioned Cellular Automata; Intrinsic Universality; Reversibility; Reversible Cellular Automata

Domaines: Informatique [cs]; Théorie et langage formel [cs.FL]

Jérôme Durand-Lose. Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata. LATIN, LATIN 1995, 1995, Valparaiso, Chile. pp.230-244, ⟨10.1007/3-540-59175-3_92⟩. ⟨hal-01559493⟩