Remarks on the Cellular Automaton Global Synchronisation Problem

Nazim Fatès 1
1 MAIA - Autonomous intelligent machine
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The global synchronisation problem consists in making a cellular automaton converge to a homogeneous blinking state from any initial condition. We here study this inverse problem for one-dimensional binary systems with periodic boundary conditions (i.e., rings). For small neighbourhoods, we present results obtained with the formulation of the problem as a SAT problem and the use of SAT solvers. Our observations suggest that it is not possible to solve this problem perfectly with deterministic systems. In contrast, the problem can easily be solved with stochastic rules.
Type de document :
Communication dans un congrès
21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. Springer, Lecture Notes in Computer Science, 9099, pp.113-126, 2015, Cellular Automata and Discrete Complex Systems. 〈http://math.utu.fi/automata2015/〉. 〈10.1007/978-3-662-47221-7_9〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01255925
Contributeur : Nazim Fatès <>
Soumis le : lundi 23 janvier 2017 - 14:29:29
Dernière modification le : jeudi 11 janvier 2018 - 06:19:51
Document(s) archivé(s) le : lundi 24 avril 2017 - 13:05:44

Fichier

338243_1_En_9_Chapter.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Nazim Fatès. Remarks on the Cellular Automaton Global Synchronisation Problem. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. Springer, Lecture Notes in Computer Science, 9099, pp.113-126, 2015, Cellular Automata and Discrete Complex Systems. 〈http://math.utu.fi/automata2015/〉. 〈10.1007/978-3-662-47221-7_9〉. 〈hal-01255925〉

Partager

Métriques

Consultations de la notice

227

Téléchargements de fichiers

4