On repetition-free binary words of minimal density
Authors:
- Gregory KucherovGKGregory Kucherov
- Yuri TarannikovYTYuri Tarannikov
- 1 April 1999
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 218 (1) , 161-175
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Open Problems in Pattern AvoidanceThe American Mathematical Monthly, 1993
- Repetitions in the Fibonacci infinite wordRAIRO - Theoretical Informatics and Applications, 1992
- Every binary pattern of length six is avoidable on the two-letter alphabetActa Informatica, 1992
- MUTUALLY AVOIDING TERNARY WORDS OF SMALL EXPONENTInternational Journal of Algebra and Computation, 1991
- Growth problems for avoidable wordsTheoretical Computer Science, 1989
- A linear-time algorithm to decide whether a binary word contains an overlapRAIRO - Theoretical Informatics and Applications, 1988
- BLOCKING SETS OF TERMSMathematics of the USSR-Sbornik, 1984
- Avoidable patterns in strings of symbolsPacific Journal of Mathematics, 1979
- Sur un théorème de ThueJournal of Combinatorial Theory, Series A, 1972