Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata
Résumé
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.