On the reversibility of ECAs with fully asynchronous updating: the recurrence point of view - Archive ouverte HAL Access content directly
Book Sections Year : 2018

On the reversibility of ECAs with fully asynchronous updating: the recurrence point of view

(1) , (2) , (3)
1
2
3

Abstract

The reversibility of classical cellular automata is now a well-studied topic but what is reversibility when the evolution of the system is stochastic? In this context, we study a particular form of reversibility: the possibility of returning infinitely often to the initial condition after a random number of time steps. This corresponds to the recurrence property of the system. We analyse this property for the 256 elementary cellular automata with a finite size and a fully asynchronous updating, that is, we update only one cell, randomly chosen, at each time step. We show that there are 46 recurrent rules which almost surely come back to their initial condition. We analyse the structure of the communication graph of the system and find that the number of the communication classes may have different scaling laws, depending on the active transitions of the rules (those for which the state of the cell is modified when an update occurs).
Fichier principal
Vignette du fichier
FatesDasSethi-recurrentECA-hal-v1-2017.pdf (467.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01571847 , version 1 (03-08-2017)

Identifiers

Cite

Nazim Fatès, Biswanath Sethi, Sukanta Das. On the reversibility of ECAs with fully asynchronous updating: the recurrence point of view. Springer. Reversibility and Universality, 2018, ⟨10.1007/978-3-319-73216-9_15⟩. ⟨hal-01571847⟩
344 View
155 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More