| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Remarks on the Cellular Automaton Global Synchronisation Problem
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
Contributor : Nazim Fatès <>
Submitted on : Monday, January 23, 2017 - 2:29:29 PM
Last modification on : Friday, February 26, 2021 - 3:28:05 PM
Long-term archiving on: : Monday, April 24, 2017 - 1:05:44 PM
Contributor : Nazim Fatès <>
Submitted on : Monday, January 23, 2017 - 2:29:29 PM
Last modification on : Friday, February 26, 2021 - 3:28:05 PM
Long-term archiving on: : Monday, April 24, 2017 - 1:05:44 PM
File
338243_1_En_9_Chapter.pdf
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution 4.0 International License