Minimal letter frequency in n-th power-Free binary words

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

Volumn 1295, Issue , 1997, Pages 347-357

  Kolpakov, Roman ^a   Kucherov, Gregory ^b  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BINARY WORDS; SUBWORDS;

ARTIFICIAL INTELLIGENCE;

EID: 84947749257     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0029978     Document Type: Conference Paper

References (16)

1. K. Baker, G. McNulty, and W. Taylor. Growth problems for avoidable words. Theoret. Comp. Sci., 69:319-345, 1989.
2. D. Bean, A. Ehrenfeucht, and G. McNulty. Avoidable patterns in strings of symbols. Pacific J. Math., 85(2):261-294, 1979.
3. J. Berstel. Axel thuds work on repetitions in words. Invited Lecture at the 4th Conference on Formal Power Series and Algebraic Combinatorics, Montreal, 1992, June 1992. accessible at http://www-litp.ibp.fr:80/berstel/.
4. J. Berstel and D. Perrin. Theory of codes. Academic Press, 1985.
5. J. Cassaigne. Motifs évitables et régularités clans les roots. Thèse de doctorat, Université Paris VI, 1994.
6. M. Crochemore and P. Goralcik. Mutually avoiding ternary words of small exponent. International Journal of Algebra and Computation, 1(4):407-410, 1991.
7. J. Currie. Open problems in pattern avoidance. American Mathematical Monthly, 100:790-793, 1993.
8. F. Dejean. Sur un théorème de Thue. J. Combinatorial Th. (A), 13:90-99, 1972.
9. A. Kfoury. A linear time algorithm testing whether a word contains an overlap. RAIRO Inf. Th., 22:135-145, 1988.
10. M. Lothaire. Combinatorics on Words, volume 17 of Encyclopedia of Mathematics and Its Applications. Addison Wesley, 1983.
11. A. Restivo and S. Salemi. On weakly square free words. Bull. Of the EATCS, 21:49-56, 1983.
12. P. Roth. Every binary pattern of length six is avoidable on the two-letter alphabet. Acta Informatica, 29:95-106, 1992.
13. A. Salomaa. Jewels of formal language theory. Computer Science Press, 1986.
14. M. Sapir. Combinatorics on words with applications, December 1993. accessible at http://.www.math.unl.edu/~msapir/ftp/course.
15. A. Thue. Uber unendliche Zeicheureihen. Norske Vid. Selsk. Skr. L Mat. Nat. Kl. Christiania, 7:1-22, 1906.
16. A. Thue. Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske Vid. Selsk. Skr. L Mat. Nat. Kl. Christiania, 10:1-67, 1912.