A generalization of repetition threshold

Theoretical Computer Science

Volumn 345, Issue 2-3, 2005, Pages 359-369

  Ilie, Lucian ^a   Ochem, Pascal ^b   Shallit, Jeffrey ^c  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b UNIVERSITÉ BORDEAUX 1   (France)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Combinatorics on words; Repetitions

Indexed keywords

NUMERICAL ANALYSIS;

COMBINATORICS ON WORDS; REPETITIONS;

COMPUTATION THEORY;

EID: 27644443727     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.07.016     Document Type: Conference Paper

References (19)

1. J. Beck, An application of Lovász local lemma: there exists an infinite 01-sequence containing no near identical intervals, in: A. Hajnal, L. Lovász, V.T. Sós (Eds.), Finite and Finite Sets, Vol. 37, Colloquia Mathematica Societatis János Bolyai, 1981, pp. 103-107.
2. J. Berstel, Axel Thue's Papers on Repetitions in Words: A Translation, Publications du Laboratoire de Combinatoire et d'Informatique Mathématique, Vol. 20, Université du Québec à Montréal, February 1995.
3. F.-J. Brandenburg Uniformly growing k-th power-free homomorphisms Theoret. Comput. Sci. 23 1983 69 82
4. J. Cassaigne, Motifs évitables et régularité dans les mots Thèse de Doctorat, Université Paris VI, Juillet 1994.
5. C. Choffrut, and J. Karhumäki Combinatorics of words G. Rozenberg A. Salomaa Handbook of Formal Languages Vol. 1 1997 Springer Berlin 329 438
6. F. Dejean Sur un théorème de Thue J. Combin. Theory. Ser. A 13 1972 90 99
7. F.M. Dekking On repetitions of blocks in binary sequences J. Combin. Theory. Ser. A 20 1976 292 299
8. R.C. Entringer, D.E. Jackson, and J.A. Schatz On nonrepetitive sequences J. Combin. Theory. Ser. A 16 1974 159 164
9. A.S. Fraenkel, and R.J. Simpson How many squares must a binary sequence contain? Electron. J. Combinatorics 2 1995 #R2
10. L. Ilie, P. Ochem, J. Shallit, A generalization of repetition threshold, in: J. Fiala, V. Koubek, J. Kratochvíl (Eds.), Proceedings of MFCS 2004: 29th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, August 22-27, 2004, Lecture Notes in Computer Science, Vol. 3153, Springer, Berlin, pp. 818-826.
11. M. Lothaire Algebraic Combinatorics on Words 2002 Cambridge University Press Cambridge
12. J. Moulin-Ollagnier Proof of Dejean's conjecture for alphabets with 5,6,7,8,9,10 and 11 letters Theoret. Comput. Sci. 95 1992 187 205
13. P. Ochem, A generator of morphisms for infinite words, in: G. Richomme (Ed.), Proceedings of WACaM: Workshop on Word Avoidability, Complexity, and Morphisms, Turku, Finland, July 17 2004, LaRIA Technical Report 2004-07, pp. 9-14.
14. J.-J. Pansiot A propos d'une conjecture de F. Dejean sur les répétitions dans les mots Disc. Appl. Math. 7 1984 297 311
15. H. Prodinger, and F.J. Urbanek Infinite 0-1-sequences without long adjacent identical blocks Discrete Math. 28 1979 277 289
16. N. Rampersad, J. Shallit, M.-W. Wang, Avoiding large squares in infinite binary words, in: Proceedings of Words '03: Fourth International Conference on Combinatorics on Words, 2003, pp. 185-197, Turku Centre for Computer Science, TUCS General Publication #27. Paper available at 〈 http://www.arxiv.org/ abs/math.CO/0306081 〉.
17. J. Shallit Simultaneous avoidance of large squares and fractional powers in infinite binary words Internat. J. Found. Comput. Sci. 15 2004 317 327 preprint available at 〈 http://www.arxiv.org/abs/math.CO/0304476 〉, 2003
18. A. Thue Über unendliche Zeichenreihen Norske vid. Selsk. Skr. Mat. Nat. Kl. 7 1906 1 22 Reprinted in: T. Nagell (Ed.), Selected Mathematical Papers of Axel Thue, Universitetsforlaget, Oslo, 1977, pp. 139-158
19. A. Thue Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen Norke vid. Selsk. Skr. Mat. Nat. Kl. 1 1912 1 67 Reprinted in: T. Nagell (Ed.), Selected Mathematical Papers of Axel Thue, Universitetsforlaget, Oslo, 1977, pp. 413-478