A tutorial on Elementary cellular automata with fully asynchronous updating - General properties and convergence dynamics - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Natural Computing Year : 2020

A tutorial on Elementary cellular automata with fully asynchronous updating - General properties and convergence dynamics

Abstract

We present a picture of the convergence properties of the 256 Elementary Cellular Automata under the fully asynchronous updating , that is, when only one cell is updated at each time step. We regroup here the results which have been presented in different articles and expose a full analysis of the behaviour of finite systems with periodic boundary conditions. Our classification relies on the scaling properties of the average convergence time to a fixed point. We observe that different scaling laws can be found, which fall in one of the following classes: logarithmic, linear, quadratic, exponential and non-converging. The techniques for quantifying this behaviour rely mainly on Markov chain theory and martingales. Most behaviours can be studied analytically but there are still many rules for which obtaining a formal characterisation of their convergence properties is still an open problem.
Fichier principal
Vignette du fichier
tutorial-Fates-AsynchECA-2020-hal-NaCo.pdf (704.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02400792 , version 1 (09-12-2019)

Identifiers

Cite

Nazim A. Fatès. A tutorial on Elementary cellular automata with fully asynchronous updating - General properties and convergence dynamics. Natural Computing, 2020, 19 (1), pp.179-197. ⟨10.1007/s11047-020-09782-7⟩. ⟨hal-02400792⟩
129 View
444 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More