Abstract
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.
Cite
CITATION STYLE
Durand-Lose, J. O. (1995). Reversible cellular automaton able to simulate any other reversible one using partitioning automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 911, pp. 230–244). Springer Verlag. https://doi.org/10.1007/3-540-59175-3_92
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
