Abstract
We examine the problem of self-stabilisation, as introduced by Dijkstra in the 1970’s, in the context of cellular automata stabilising on k-colourings, that is, on infinite grids which are coloured with k distinct colours in such a way that adjacent cells have different colours. Suppose that for whatever reason (e.g., noise, previous usage, tampering by an adversary), the colours of a finite number of cells in a valid k-colouring are modified, thus introducing errors. Is it possible to reset the system into a valid k-colouring with only the help of a local rule? In other words, is there a cellular automaton which, starting from any finite perturbation of a valid k-colouring, would always reach a valid k-colouring in finitely many steps? We discuss the different cases depending on the number of colours, and propose some deterministic and probabilistic rules which solve the problem for \(k\ne 3\). We also explain why the case \(k=3\) is more delicate. Finally, we propose some insights on the more general setting of this problem, passing from k-colourings to other tilings (subshifts of finite type).
S. Taati—The work of ST was partially supported by NWO grant 612.001.409 of Tobias Müller.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alon, N., Briceño, R., Chandgotia, N., Magazinov, A., Spinka, Y.: Mixing properties of colorings of the \(\mathbb{Z}^d\) lattice. Preprint arXiv:1903.11685 (2019)
Bȩbenek, A., Ziuzia-Graczyk, I.: Fidelity of DNA replication—a matter of proofreading. Curr. Genet. 64, 985–996 (2018)
Bušić, A., Fatès, N., Mairesse, J., Marcovici, I.: Density classification on infinite lattices and trees. Electron. J. Probab. 18(51), 22 (2013)
Dijkstra, E.W.: Self-stabilization in spite of distributed control. In: Dijkstra, E.W. (ed.) Selected Writings on Computing: A personal Perspective. Texts and Monographs in Computer Science, pp. 41–46. Springer, New York (1982). https://doi.org/10.1007/978-1-4612-5695-3_7
Fatès, N.: Asynchronous cellular automata. In: Adamatzky, A. (ed.) Cellular Automata. ECSSS, pp. 73–92. Springer, New York (2018). https://doi.org/10.1007/978-1-4939-8700-9_671
Gach, P., Kurdyumov, G.L., Levin, L.A.: One-dimensional uniform arrays that wash out finite islands. Probl. Inf. Transm. 14(3), 223–226 (1978)
Gács, P.: Reliable computation with cellular automata. J. Comput. Syst. Sci. 32(1), 15–78 (1986)
Gács, P., Reif, J.: A simple three-dimensional real-time reliable cellular array. J. Comput. Syst. Sci. 36(2), 125–147 (1988)
Marcus, B., Pavlov, R.: An integral representation for topological pressure in terms of conditional probabilities. Isr. J. Math. 207(1), 395–433 (2017)
Pippenger, N.: Symmetry in self-correcting cellular automata. J. Comput. Syst. Sci. 49(1), 83–95 (1994)
Toom, A.L.: Nonergodic multidimensional system of automata. Probl. Peredachi Inf. 10(3), 70–79 (1974)
Toom, A.L.: Stable and attractive trajectories in multicomponent systems. In: Multicomponent Random Systems. Advances in Probability. Related Topics, Dekker, New York, vol. 6, pp. 549–575 (1980)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Fatès, N., Marcovici, I., Taati, S. (2019). Cellular Automata for the Self-stabilisation of Colourings and Tilings. In: Filiot, E., Jungers, R., Potapov, I. (eds) Reachability Problems. RP 2019. Lecture Notes in Computer Science(), vol 11674. Springer, Cham. https://doi.org/10.1007/978-3-030-30806-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-30806-3_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-30805-6
Online ISBN: 978-3-030-30806-3
eBook Packages: Computer ScienceComputer Science (R0)