A generalization of repetition threshold

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3153, Issue , 2004, Pages 818-826

  Llie, 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

[No Author keywords available]

Indexed keywords

COMPUTERS;

BRANDENBURG; INFINITE WORD; NUMERICAL EVIDENCE; REAL NUMBER;

ARTIFICIAL INTELLIGENCE;

EID: 35048895040     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

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, and V. T. Sós, editors, Finite and Finite Sets, Vol. 37 of Colloq. Math. Soc. János Bolyai, pp. 103-107. 1981.
2. J. Berstel. Axel Thue's Papers on Repetitions in Words: a Translation. Number 20 in Publications du Laboratoire de Combinatoire et d'Informatique Mathématique. Université du Québec à Montréal, February 1995.
3. F.-J. Brandenburg. Uniformly growing κ-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. G. Choffrut and J. Karhumäki. Combinatorics of words. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Vol. 1, pp. 329-438. SpringerVerlag, 1997.
6. F. Dejean. Sur un théorème deThue. 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. G. 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? Electronic J. Combinatorics 2 (1995), #R2.
10. M. Lothaire. Algebraic Combinatorics on Words. Cambridge Univ. Press, 2002.
11. 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.
12. 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.
13. H. Prodinger and F. J. Urbanek. Infinite 0-1-sequences without long adjacent identical blocks. Discrete Math. 28 (1979), 277-289.
14. N. Rampersad, J. Shallit, and M.-w. Wang. Avoiding large squares in infinite binary words. In Proceedings of Words '03: 4th International Conference on Combinatorics on Words, pp. 185-197. 2003. Turku Centre for Computer Science, TUGS General Publication #27. Paper available at http://www.arxiv.org/ abs/math.C0/0306081.
15. J. Shallit. Simultaneous avoidance of large squares and fractional powers in infinite binary words. Int. J. Found. Comput. Sci. 15 (2004), 317-327. Preprint available at http://www.arxiv.org/abs/math.C0/0304476, 2003.
16. A. Thue. Über unendliche Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 7 (1906), 1-22.
17. Reprinted in Selected Mathematical Papers of Axel Thue, T. Nagell, editor, Universitetsforlaget, Oslo, 1977, pp. 139-158.
18. A. Thue. Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 1 (1912), 1-67.
19. Reprinted in Selected Mathematical Papers of Axel Thue, T. Nagell, editor, Universitetsforlaget, Oslo, 1977, pp. 413478.