Conference Papers Year : 2013

A note on the fast convergence of asynchronous Elementary Cellular Automata

Nazim Fatès

Abstract

We tackle the problem of the classification of elementary cellular automata when the cells are updated in with a fully asynchronous scheme (one cell is selected at random at each time step). We establish a proof of convergence in logarithmic time as a function of the size of the automaton. Techniques involve a direct Markov chain analysis or the construction of potential function whose convergence rate is bounded by a particular martingale.
Fichier principal
Vignette du fichier
logConverge.pdf (176.28 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00981691 , version 1 (22-04-2014)

Licence

Identifiers

Cite

Nazim Fatès. A note on the fast convergence of asynchronous Elementary Cellular Automata. 19th International Workshop, AUTOMATA 2013,, Sep 2013, Gießen, Germany. pp.31-45, ⟨10.1007/978-3-642-40867-0_3⟩. ⟨hal-00981691⟩
654 View
363 Download

Altmetric

Share

More