Abstract
Local constraints on an infinite sequence that imply global regularity are of general interest in combinatorics on words. We consider this topic by studying everywhere α -repetitive sequences, sequences in which every position has an occurrence of a repetition of order α ≥ 1 of bounded length. The number of minimal such repetitions, called minimal α -powers, is then finite. A natural question regarding global regularity is to determine the least number of minimal α-powers such that an α-repetitive sequence is not necessarily ultimately periodic. We solve this question for 1 ≤ α ≤ 17/8. We also show that Sturmian words are among the optimal 2 - and 2 + -repetitive sequences.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Allouche, J.-P., Shallit, J.: Automatic sequences. Theory, applications, generalizations. Cambridge University Press, Cambridge (2003)
Allouche, J.-P., Shallit, J.: The ubiquitous Prouhet-Thue-Morse sequence. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.) Sequences and their applications. Proceedings of SETA 1998, pp. 1–16. Springer, Heidelberg (1999)
Choffrut, C., Karhumäki, J.: Combinatorics of words. Handbook of formal languages 1, 329–438 (1997)
Karhumäki, J., Lepistö, A., Plandowski, W.: Locally periodic versus globally periodic infinite words. J. Combin. Theory Ser. A 100(2), 250–264 (2002)
Lothaire, M.: Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications, p. 90. Cambridge University Press, Cambridge (2002)
Mignosi, F., Restivo, A., Salemi, S.: Periodicity and the golden ratio. Theoret. Comput. Sci. 204(1-2), 153–167 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saari, K. (2007). Everywhere α-Repetitive Sequences and Sturmian Words. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds) Computer Science – Theory and Applications. CSR 2007. Lecture Notes in Computer Science, vol 4649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74510-5_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-74510-5_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74509-9
Online ISBN: 978-3-540-74510-5
eBook Packages: Computer ScienceComputer Science (R0)