Skip to Main content Skip to Navigation
New interface
Conference papers

Reversibility of Elementary Cellular Automata Under Fully Asynchronous Update

Biswanath Sethi 1 Nazim Fatès 2 Sukanta Das 3 
2 MAIA - Autonomous intelligent machine
Inria Nancy - Grand Est, LORIA - AIS - Department of Complex Systems, Artificial Intelligence & Robotics
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.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Nazim Fatès Connect in order to contact the contributor
Submitted on : Wednesday, January 15, 2014 - 3:30:12 PM
Last modification on : Friday, November 4, 2022 - 3:02:55 PM
Long-term archiving on: : Saturday, April 8, 2017 - 4:30:39 PM


Files produced by the author(s)



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⟩



Record views


Files downloads