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.
This research was partially supported by ECOS and the French Cooperation in Chile.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. O. Durand-Lose. Partitioning Automata, Cellular Automata, Simulation and Reversibility. Technical report, Laboratoire de l'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon, 46 allée d'Italie, 69 364 Lyon cedex 7, 1994.
E. Fredkin and T. Toffoli. Conservative Logic. Int. J. of Theoretical Physics, 21, 3/4:219–253, 1982.
J. Kari. Reversibility of 2d Cellular Automata is Undecidable. Physica D, (45):379–385, 1990.
N. Margolus. Physics and Computation. PhD thesis, MIT, 1988.
E. Moore. Machine Models of Self-Reproduction. In Proc. Symp. Appl. Math., number 14, pages 17–33, 1962.
K. Morita. A Simple Construction Method of a Reversible Finite Automaton out of Fredkin Gates, and its Related Problem. Transactions of the IEICE, E 73(6):978–984, June 1990.
K. Morita. Computation-universality of One-dimensional One-way Reversible Cellular Automata. Information Processing Letters, 42:325–329, 1992.
K. Morita and S. Ueno. Computation-Universal Models of Two-Dimensional 16-State Reversible Automata. IEICE Trans. Inf. & Syst., E75-D(1):141–147, January 1992.
J. Myhill. The Converse of Moore's Garden-of-Eden Theorem. In Proc. Symp. Appl. Math., number XIV, pages 685–686, 1963.
D. Richardson. Tessellations with Local Transformations. Journal of Computer and System Sciences, (6):373–388, 1972.
T. Serizawa. Three-State Neumann Neighbor Cellular Automata Capable of Constructing Self-Reproducing Machines. Systems and Computers in Japan, 18(4):33–40, 1987.
T. Toffoli. Computation and Construction Universality of Reversible Cellular Automata. Journal of Computer and System Sciences, (15):213–231, 1977.
T. Toffoli. Reversible Computing. Rapport M.I.T., (MIT/LCS/TM-151), 1980.
T. Toffoli and N. Margolus. Cellular Automata Machine — A New Environment for Modeling. MIT press, Cambridge, MA, 1987.
T. Toffoli and N. Margolus. Invertible Cellular Automata: A Review. Physica D, (45):229–253, 1990.
S. Wolfram. Theory and Applications of Cellular Automata. World Scientific, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Durand-Lose, J.O. (1995). Reversible cellular automaton able to simulate any other reversible one using partitioning automata. In: Baeza-Yates, R., Goles, E., Poblete, P.V. (eds) LATIN '95: Theoretical Informatics. LATIN 1995. Lecture Notes in Computer Science, vol 911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59175-3_92
Download citation
DOI: https://doi.org/10.1007/3-540-59175-3_92
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59175-7
Online ISBN: 978-3-540-49220-7
eBook Packages: Springer Book Archive