Abstract
The notion of synchronized sequence, introduced by Carpi and Maggi in 2002, has turned out to be a very useful tool for investigating the properties of words. Moreover, if sequence is synchronized, then one can use a theorem-prover such as Walnut to “automatically” prove many results about it, with little human intervention. In this paper I will prove some of the basic properties of synchronization, and give a number of applications to combinatorics on words.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Allouche, J.-P., Bétréma, J., Shallit, J.: Sur des points fixes de morphismes du monoïde libre. RAIRO Inform. Théor. App. 23, 235–249 (1989)
Allouche, J.-P., Rampersad, N., Shallit, J.: On integer sequences whose first iterates are linear. Aequationes Math. 69, 114–127 (2005)
Allouche, J.-P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)
Allouche, J.-P., Shallit, J.O.: The ring of \(k\)-regular sequences. Theoret. Comput. Sci. 98, 163–197 (1992)
Allouche, J.-P., Shallit, J.O.: The ring of \(k\)-regular sequences. II. Theoret. Comput. Sci. 307, 3–29 (2003)
Blondin Massé, A., Brlek, S., Garon, A., Labbé, S.: Combinatorial properties of \(f\)-palindromes in the Thue-Morse sequence. Pure Math. Appl. 19(2–3), 39–52 (2008). http://puma.dimai.unifi.it/19_2_3/4.pdf
Bruyère, V., Hansel, G., Michaux, C., Villemaire, R.: Logic and \(p\)-recognizable sets of integers. Bull. Belgian Math. Soc. 1, 191–238 (1994). corrigendum, Bull. Belgian Math. Soc. 1, 577 (1994)
Bugeaud, Y., Kim, D.H.: A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers. Trans. Amer. Math. Soc. 371, 3281–3308 (2019)
Carpi, A., D’Alonzo, V.: On the repetitivity index of infinite words. Int. J. Algebra Comput. 19, 145–158 (2009)
Carpi, A., Maggi, C.: On synchronized sequences and their separators. RAIRO Inform. Théor. App. 35, 513–524 (2001)
Charlier, E., Rampersad, N., Shallit, J.: Enumeration and decidable properties of automatic sequences. Int. J. Found. Comp. Sci. 23, 1035–1066 (2012)
Dekking, F.M.: The Frobenius problem for homomorphic embeddings of languages into the integers. Theoret. Comput. Sci. 732, 73–79 (2018)
Goč, D., Schaeffer, L., Shallit, J.: Subword complexity and k-synchronization. In: Béal, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 252–263. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38771-5_23
Hilbert, D.: Über die stetige Abbildung einer Linie auf ein Flächenstück. Math. Annalen 38, 459–460 (1891)
Lekkerkerker, C.G.: Voorstelling van natuurlijke getallen door een som van getallen van Fibonacci. Simon Stevin 29, 190–195 (1952)
Mousavi, H.: Automatic theorem proving in Walnut (2016). Preprint available at http://arxiv.org/abs/1603.06017
Propp, J.: Problem proposal 474. Crux Math. 5, 229 (1979). Solution by G. Patruno, Crux Math. 6, 198 (1980)
Reble, D.: Zeckendorf vs. Wythoff representations: comments on A007895 (2008). Manuscript available at https://oeis.org/A007895/a007895.pdf
Shallit, J.: Hilbert’s spacefilling curve described by automatic, regular, and synchronized sequences (2021). Preprint, https://arxiv.org/abs/2106.01062
Shallit, J.: The Logical Approach to Automatic Sequences: Exploring Combinatorics on Words with Walnut. Cambridge University Press (2022, to appear)
Shallit, J.O.: Numeration systems, linear recurrences, and regular sets. Inform. Comput. 113, 331–347 (1994)
Shallit, J.O., Stolfi, J.: Two methods for generating fractals. Comput. Graph. 13, 185–191 (1989)
Sloane, N.J.A., et al.: The on-line encyclopedia of integer sequences (2021). https://oeis.org
Szilard, A., Yu, S., Zhang, K., Shallit, J.: Characterizing regular languages with polynomial densities. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol. 629, pp. 494–503. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-55808-X_48
Wythoff, W.A.: A modification of the game of Nim. Nieuw Archief voor Wiskunde 7, 199–202 (1907)
Zeckendorf, E.: Représentation des nombres naturels par une somme de nombres de Fibonacci ou de nombres de Lucas. Bull. Soc. Roy. Liège 41, 179–182 (1972)
Acknowledgments
Thanks to Jean-Paul Allouche and Narad Rampersad for their helpful comments.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Shallit, J. (2021). Synchronized Sequences. In: Lecroq, T., Puzynina, S. (eds) Combinatorics on Words. WORDS 2021. Lecture Notes in Computer Science(), vol 12847. Springer, Cham. https://doi.org/10.1007/978-3-030-85088-3_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-85088-3_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-85087-6
Online ISBN: 978-3-030-85088-3
eBook Packages: Computer ScienceComputer Science (R0)