Conference Papers Year : 2014

Reversibility of Elementary Cellular Automata Under Fully Asynchronous Update

Abstract

We investigate the dynamics of Elementary Cellular Automata (ECA) under fully asynchronous update with periodic boundary conditions. We tackle the reversibility issue, that is, we want to determine whether, starting from any initial condition, it is possible to go back to this initial condition with random updates. We present analytical tools that allow us to partition the ECA space into three classes: strongly irreversible, irreversible and recurrent.
Fichier principal
Vignette du fichier
hal-revACA.pdf (280.37 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00906987 , version 1 (21-11-2013)
hal-00906987 , version 2 (15-01-2014)

Identifiers

Cite

Biswanath Sethi, Nazim Fatès, Sukanta Das. Reversibility of Elementary Cellular Automata Under Fully Asynchronous Update. Theory and Applications of Models of Computation, Apr 2014, Chennai, India. ⟨10.1007/978-3-319-06089-7_4⟩. ⟨hal-00906987v2⟩
337 View
690 Download

Altmetric

Share

More