A note on the classiffcation of the most simple asynchronous cellular automata

Nazim Fatès 1
1 MAIA - Autonomous intelligent machine
Inria Nancy - Grand Est, LORIA - AIS - Department of Complex Systems, Artificial Intelligence & Robotics
Abstract : This text presents some notes on the classification of very simple rules in one and two dimensions. We focus on the 256 Elementary Cellular Automata and the 64 totalistic rules with von Neumann neighbourhood. The updating scheme is fully asynchronous updating, that is, only one cell is updated randomly and uniformly at each time step. While a partial classification of such rules has been proposed some years ago, very few progress has been made since then. In order to understand the obstacles to a complete classification, we here mainly adopt an experimental approach based on the observations of the space-time diagrams. We also give some sketch of proofs when possible and underline the interesting open problems.
Type de document :
Communication dans un congrès
Andreas Malcher and Martin Kutrib. AUTOMATA 2013, Sep 2013, Giessen, Germany. Springer, 8155, pp.31-45, 2013, LNCS. 〈10.1007/978-3-642-40867-0_2〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00846059
Contributeur : Nazim Fatès <>
Soumis le : jeudi 18 juillet 2013 - 14:36:14
Dernière modification le : mercredi 24 octobre 2018 - 15:24:02

Lien texte intégral

Identifiants

Citation

Nazim Fatès. A note on the classiffcation of the most simple asynchronous cellular automata. Andreas Malcher and Martin Kutrib. AUTOMATA 2013, Sep 2013, Giessen, Germany. Springer, 8155, pp.31-45, 2013, LNCS. 〈10.1007/978-3-642-40867-0_2〉. 〈hal-00846059〉

Partager

Métriques

Consultations de la notice

243