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.
https://hal.inria.fr/hal-01255925
Contributeur : Nazim Fatès
<>
Soumis le : lundi 23 janvier 2017 - 14:29:29
Dernière modification le : mercredi 24 octobre 2018 - 15:24:02
Document(s) archivé(s) le : lundi 24 avril 2017 - 13:05:44
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〉
