Abstract
This paper deals with simulation and reversibility in the context of Cellular Automata (ca). We recall the definitions of ca and of the Block (bca) and Partitioned (pca) subclasses. We note that pca simulate ca. A simulation of reversible ca (r-ca) with reversible pca is built contradicting the intuition of known undecidability results. We build a 1-r-ca which is intrinsic universal, i.e., able to simulate any 1-r-ca.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Amoroso and Y. Patt. Decision procedure for surjectivity and injectivity of parallel maps for tessellation structure. Journal of Computer and System Sciences, 6:448–464, 1972.
C. H. Bennett. Logical reversibility of computation. IBM Journal of Research and Development, 6:525–532, 1973.
J. O. Durand-Lose. Reversible cellular automaton able to simulate any other reversible one using partitioning automata. In latin '95, number 911 in Lecture Notes in Computer Science, pages 230–244. Springer-Verlag, 1995.
J. O. Durand-Lose. Automates Cellulaires, Automates à Partitions et Tas de Sable. PhD thesis, labri, 1996. In French.
G. A. Hedlung. Endomorphism and automorphism of the shift dynamical system. Mathematical System Theory, 3:320–375, 1969.
J. Kari. Reversibility of 2D cellular automata is undecidable. Physica D, 45:379–385, 1990.
J. Kari. Reversibility and surjectivity problems of cellular automata. Journal of Computer and System Sciences, 48(1):149–182, 1994.
J. Kari. Representation of reversible cellular automata with block permutations. Mathematical System Theory, 29:47–61, 1996.
N. Margolus. Physics-like models of computation. Physica D, 10:81–95, 1984.
B. Martin. A universal cellular automaton in quasi-linear time and its S-n-m form. Theoretical Computer Science, 123:199–237, 1994.
E. Moore. Machine models of self-reproduction. In Proceeding of Symposium on Applied Mathematics, volume 14, pages 17–33, 1962.
K. Morita. Computation-universality of one-dimensional one-way reversible cellular automata. Information Processing Letters, 42:325–329, 1992.
K. Morita. Reversible simulation of one-dimensional irreversible cellular automata. Theoretical Computer Science, 148:157–163, 1995.
J. Myhill. The converse of Moore's garden-of-eden theorem. In Proceedings of the Symposium of Applied Mathematics, number 14, pages 685–686, 1963.
D. Richardson. Tessellations with local transformations. Journal of Computer and System Sciences, 6:373–388, 1972.
T. Toffoli. Computation and construction universality of reversible cellular automata. Journal of Computer and System Sciences, 15:213–231, 1977.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Durand-Lose, J.O. (1997). Intrinsic universality of a 1-dimensional reversible Cellular Automaton. In: Reischuk, R., Morvan, M. (eds) STACS 97. STACS 1997. Lecture Notes in Computer Science, vol 1200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023479
Download citation
DOI: https://doi.org/10.1007/BFb0023479
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62616-9
Online ISBN: 978-3-540-68342-1
eBook Packages: Springer Book Archive