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.
Type de document :
Communication dans un congrès
Theory and Applications of Models of Computation, Apr 2014, Chennai, India. Springer, Lecture Notes of Computer Science, 8402, Theory and Applications of Models of Computation. <10.1007/978-3-319-06089-7_4>


https://hal.inria.fr/hal-00906987
Contributeur : Nazim Fatès <>
Soumis le : mercredi 15 janvier 2014 - 15:30:12
Dernière modification le : mercredi 28 septembre 2016 - 11:01:10

Fichier

hal-revACA.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

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. Springer, Lecture Notes of Computer Science, 8402, Theory and Applications of Models of Computation. <10.1007/978-3-319-06089-7_4>. <hal-00906987v2>

Partager

Métriques

Consultations de
la notice

335

Téléchargements du document

213