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.
Keywords
- Inverse problems
- SAT solving
- Stochastic vs. deterministic solutions
Download conference paper PDF
References
Betel, H., de Oliveira, P.P.B., Flocchini, P.: Solving the parity problem in one-dimensional cellular automata. Natural Computing 12(3), 323–337 (2013)
Briceño, R., Moisset de Espanés, P., Osses, A., Rapaport, I.: Solving the density classification problem with a large diffusion and small amplification cellular automaton. Physica D: Nonlinear Phenomena 261, 70–80 (2013)
Bušić, A., Fatès, N., Mairesse, J., Marcovici, I.: Density classification on infinite lattices and trees. Electronic Journal of Probability 18(51), 1–22 (2013). http://ejp.ejpecp.org/article/view/2325
Das, R., Crutchfield, J.P., Mitchell, M., Hanson, J.E.: Evolving globally synchronized cellular automata. In: Proceedings of 6th ICGA, pp. 336–343. Morgan Kaufmann, San Francisco (1995)
Fatès, N.: Stochastic cellular automata solutions to the density classification problem - when randomness helps computing. Theory of Computing Systems 53(2), 223–242 (2013)
Fatès, N., Regnault, D., Schabanel, N., Thierry, É.: Asynchronous behavior of double-quiescent elementary cellular automata. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 455–466. Springer, Heidelberg (2006)
Maignan, L., Yunès, J.-B.: Experimental finitization of infinite field-based generalized FSSP solution. In: Wąs, J., Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2014. LNCS, vol. 8751, pp. 136–145. Springer, Heidelberg (2014)
Mairesse, J., Marcovici, I.: Around probabilistic cellular automata. Theoretical Computer Science 559, 42–72 (2014)
Oliveira, G.M., Martins, L.G., de Carvalho, L.B., Fynn, E.: Some investigations about synchronization and density classification tasks in one-dimensional and two-dimensional cellular automata rule spaces. Electronic Notes in Theoretical Computer Science 252, 121–142 (2009)
de Oliveira, P.P.B.: On density determination with cellular automata: Results, constructions and directions. Journal of Cellular Automata 9(5–6), 357–385 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 IFIP International Federation for Information Processing
About this paper
Cite this paper
Fatès, N. (2015). Remarks on the Cellular Automaton Global Synchronisation Problem. In: Kari, J. (eds) Cellular Automata and Discrete Complex Systems. AUTOMATA 2015. Lecture Notes in Computer Science(), vol 9099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47221-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-662-47221-7_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47220-0
Online ISBN: 978-3-662-47221-7
eBook Packages: Computer ScienceComputer Science (R0)