%0 Conference Proceedings
%T Remarks on the Cellular Automaton Global Synchronisation Problem
%+ Autonomous intelligent machine (MAIA)
%A Fatès, Nazim
%Z Part 2: Regular Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Turku, Finland
%I Springer
%3 Cellular Automata and Discrete Complex Systems
%V 9099
%P 113-126
%8 2015-06-08
%D 2015
%R 10.1007/978-3-662-47221-7_9
%K inverse problems
%K SAT solving
%K stochastic vs. deterministic solutions
%Z Computer Science [cs]
%Z Nonlinear Sciences [physics]/Cellular Automata and Lattice Gases [nlin.CG]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-01255925/document
%2 https://inria.hal.science/hal-01255925/file/338243_1_En_9_Chapter.pdf
%L hal-01255925
%U https://inria.hal.science/hal-01255925
%~ CNRS
%~ INRIA
%~ INPL
%~ INRIA-LORRAINE
%~ LORIA2
%~ INRIA-NANCY-GRAND-EST
%~ TESTALAIN1
%~ IFIP-LNCS
%~ IFIP
%~ UNIV-LORRAINE
%~ INRIA2
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ TDS-MACS
%~ LORIA
%~ IFIP-LNCS-9099
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA