Partial Reversibility of One-Dimensional Cellular Automata

Abstract : Reversibility is the property of very special cellular automata rules by which any path traversed in the configuration space can be traversed back by its inverse rule. Expanding this context, the notion of partial reversibility has been previously proposed in the literature, as an attempt to refer to rules as being more or less reversible than others, since some of the paths of non-reversible rules could be traversed back. The approach was couched in terms of a characterisation of the rule’s pre-image pattern, that is, the number of pre-images of a rule for all configurations up to a given size, and their relative lexicographical ordering used to classify the rules in terms of their relative partial reversibility. Here, we reassess the original definition and define a measure that represents the reversibility degree of the rules, also based on their pre-image patterns, but now relying on the probability of correctly reverting each possible cyclic, finite length configuration, up to a maximum size. As a consequence, it becomes possible to look at partial reversibility in absolute terms, and not relatively to other rules, as well to infer the reversibility degrees for arbitrary lattice sizes, even in its limit to infinity. All the discussions are restricted to the elementary space, but are also applicable to any one-dimensional rule space.
Type de document :
Communication dans un congrès
Matthew Cook; Turlough Neary. 22th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2016, Zurich, Switzerland. Lecture Notes in Computer Science, LNCS-9664, pp.120-134, 2016, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-319-39300-1_10〉
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01435024
Contributeur : Hal Ifip <>
Soumis le : vendredi 13 janvier 2017 - 15:23:43
Dernière modification le : vendredi 13 janvier 2017 - 15:29:41
Document(s) archivé(s) le : vendredi 14 avril 2017 - 19:20:51

Fichier

 Accès restreint
Fichier visible le : 2019-01-01

Connectez-vous pour demander l'accès au fichier

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Ronaldo Castro Corrêa, Pedro Oliveira. Partial Reversibility of One-Dimensional Cellular Automata. Matthew Cook; Turlough Neary. 22th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2016, Zurich, Switzerland. Lecture Notes in Computer Science, LNCS-9664, pp.120-134, 2016, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-319-39300-1_10〉. 〈hal-01435024〉

Partager

Métriques

Consultations de la notice

44