On repetition-free binary words of minimal density

Theoretical Computer Science

Volumn 218, Issue 1, 1999, Pages 161-175

  Kolpakov, Roman ^a   Kucherov, Gregory ^b   Tarannikov, Yuri ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b LORIA   (France)

Author keywords

Exponent; Minimal density; Power free words; Unavoidable patterns

Indexed keywords

EID: 0347653264     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00257-6     Document Type: Article

References (23)

1. A.H. SHMHH. EjiOKHpyromHe MHOJKCCTBa TepMOB, MameMamuuecKuu C6opnuK, 119 (3) (1982) 363-375; English Translation: A.I. Zimin, Blocking sets of terms, Math. USSR Sbornik 47 (1984) 353-364.
2. K. Baker, G. McNulty, W. Taylor, Growth problems for avoidable words, Theoret. Comput. Sci. 69 (1989) 319-345.
3. D. Bean, A. Ehrenfeucht, G. McNulty, Avoidable patterns in strings of symbols, Pacific J. Math. 85 (2) (1979) 261-294.
4. J. Berstel, Axel Thue's work on repetitions in words, Invited Lecture at the 4th Con. Formal Power Series and Algebraic Combinatorics, Montreal, 1992, June 1992, accessible at http://www-igm.univ-mlv.fr/~berstel/index.html.
5. J. Berstel, D. Perrin, Theory of Codes, Academic Press, New York, 1985.
6. J. Cassaigne, Motifs évitables et régularités dans les mots, Thèse de doctorat, Université Paris VI, 1994.
7. C. Choffrut, J. Karhumäki, Combinatorics of words, in: G. Rozenberg, A. Salomaa (Eds.), Handbook on Formal Languages, vol. I, Springer, Berlin, 1997.
8. M. Crochemore, P. Goralcik, Mutually avoiding ternary words of small exponent, Internat. J. Algebra Comput. 1 (4) (1991) 407-410.
9. J. Currie, Open problems in pattern avoidance, Amer, Math. Monthly 100 (1993) 790-793.
10. J. Currie, R. Shelton, Cantor sets and Dejean's conjecture, J. Automata Languages Combin. 1 (2) (1996) 113-128.
11. F. Dejean, Sur un théorème de Thue, J. Combin. Theor. A 13 (1972) 90-99.
12. M. Dekking, On the Thue-Morse measure, Acta Univ. Carolin. Math. Phys. 33 (2) (1992) 35-40.
13. A. Kfoury, A linear time algorithm testing whether a word contains an overlap, RAIRO Inform. Theor. 22 (1988) 135-145.
14. R. Kolpakov, G. Kucherov, Minimal letter frequency in n-power-free binary words, in: I. Privara, P. Ružička (Eds.), Proc. 22nd Internat. Symp. on Mathematical Foundations of Computer Science (MFCS), Bratislava (Slovakia), Lecture Notes in Computer Science, vol. 1295, Springer. Berlin, 1997, pp. 347-357.
15. M. Lothaire, Combinatorics on Words, Encyclopedia of Mathematics and Its Applications, vol. 17, Addison-Wesley, Reading, MA, 1983.
16. F. Mignosi, G. Pirillo, Repetitions in the Fibonacci infinite word, RAIRO Theoret. Inform. 26 (3) (1992) 199-204.
17. F. Mignosi, A. Restivo, S. Salemi, A periodicity theorem on words and applications, in: Proc. 20th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science, vol. 969, Springer, Berlin, 1995, pp. 337-348.
18. A. Restivo, S. Salemi, On weakly square free words, Bull. EATCS 21 (1983) 49-56.
19. P. Roth, Every binary pattern of length six is avoidable on the two-letter alphabet, Acta Informatica 29 (1992) 95-106.
20. A. Salomaa, Jewels of Formal Language Theory, Computer Science Press, Rockville, MD, 1986.
21. M. Sapir, Combinatorics on words with applications, December 1993. accessible at http://www.math. unl.edu/~ msapir/ftp/course.
22. A. Thue, Über unendliche Zeichenreihen, Norske Vid. Selsk. Skr. 1. Mat. Nat. Kl. Christiania 7 (1906) 1-22.
23. A. Thue, Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiania 10 (1912) 1-67.