Skip to Main content Skip to Navigation
Conference papers

Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton

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} (RCA) with reversible {PCA} is built contradicting the intuition of known undecidability results. We build a {1d-RCA} which is intrinsically universal, i.e., able to simulate any 1d-R-CA.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01559642
Contributor : Jérôme Durand-Lose <>
Submitted on : Monday, July 10, 2017 - 5:35:00 PM
Last modification on : Thursday, January 11, 2018 - 6:20:17 AM

Links full text

Identifiers

Collections

Citation

Jérôme Durand-Lose. Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton. STACS, 1997, Lübeck, Germany. pp.439-450, ⟨10.1007/BFb0023479⟩. ⟨hal-01559642⟩

Share

Metrics

Record views

191