Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata
Contributor : Nazim Fatès Connect in order to contact the contributor
Submitted on : Thursday, July 18, 2013 - 2:36:14 PM
Last modification on : Saturday, June 25, 2022 - 7:44:32 PM

Links full text



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



Record views