Abstract
We consider the following novel variation on a classical avoidance problem from combinatorics on words: instead of avoiding repetitions in all factors of a word, we avoid repetitions in all factors where each individual factor is considered as a “circular word”, i.e., the end of the word wraps around to the beginning. We determine the best possible avoidance exponent for alphabet size 2 and 3, and provide a lower bound for larger alphabets.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aberkane, A., Currie, J.D.: There exist binary circular 5/2 + power free words of every length. Electronic J. Combin. 11(1) (2004) Paper #R10, http://www1.combinatorics.org/Volume_11/Abstracts/v11i1r10.html
Brandenburg, F.-J.: Uniformly growing k-th power-free homomorphisms. Theoret. Comput. Sci. 23, 69–82 (1983)
Carpi, A.: On Dejean’s conjecture over large alphabets. Theoret. Comput. Sci. 385, 137–151 (2007)
Currie, J., Rampersad, N.: A proof of Dejean’s conjecture. Math. Comp. 80, 1063–1070 (2011)
Dejean, F.: Sur un théorème de Thue. J. Combin. Theory. Ser. A 13, 90–99 (1972)
Gorbunova, I.A.: Repetition threshold for circular words. Electronic J. Combin. 19(4) Paper #11, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i4p11
Harju, T., Nowotka, D.: Cyclically repetition-free words on small alphabets. Inform. Process Lett. 110, 591–595 (2010)
Ilie, L., Ochem, P., Shallit, J.: A generalization of repetition threshold. Theoret. Comput. Sci. 345, 359–369 (2005)
Rao, M.: Last cases of Dejean’s conjecture. Theoret. Comput. Sci. 412, 3010–3018 (2011)
Thue, A.: Über unendliche Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 7, 1–22 (1906), Reprinted in Selected Mathematical Papers of Axel Thue. Nagell, T. (ed.) Universitetsforlaget, Oslo, pp. 139–158 (1977)
Thue, A.: Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 1, 1–67 (1912); Reprinted in Selected Mathematical Papers of Axel Thue. Nagell, T. (ed.) Universitetsforlaget, Oslo, pp. 413–478 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mousavi, H., Shallit, J. (2013). Repetition Avoidance in Circular Factors. In: Béal, MP., Carton, O. (eds) Developments in Language Theory. DLT 2013. Lecture Notes in Computer Science, vol 7907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38771-5_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-38771-5_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38770-8
Online ISBN: 978-3-642-38771-5
eBook Packages: Computer ScienceComputer Science (R0)