On repetition-free binary words of minimal density

DOI10.1016/S0304-3975(98)00257-6zbMath0916.68118WikidataQ58064535 ScholiaQ58064535MaRDI QIDQ1292490

Gregory Kucherov, Roman M. Kolpakov

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

exponentminimal densitypower-free wordsunavoidable patterns

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (10)

Letter frequency in infinite repetition-free words ⋮ On the entropy and letter frequencies of powerfree words ⋮ Polynomial versus exponential growth in repetition-free binary words ⋮ Avoiding or Limiting Regularities in Words ⋮ Growth properties of power-free languages ⋮ Pattern avoidance: themes and variations ⋮ Infinite words containing squares at every position ⋮ WORDS AVOIDING $\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISM ⋮ Dejean's conjecture and letter frequency ⋮ Dejean's conjecture and letter frequency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Growth problems for avoidable words
• Avoidable patterns in strings of symbols
• Every binary pattern of length six is avoidable on the two-letter alphabet
• A note on decidability questions on presentations of word semigroups
• Sur un théorème de Thue
• A periodicity theorem on words and applications
• BLOCKING SETS OF TERMS
• A linear-time algorithm to decide whether a binary word contains an overlap
• Repetitions in the Fibonacci infinite word
• MUTUALLY AVOIDING TERNARY WORDS OF SMALL EXPONENT
• Open Problems in Pattern Avoidance

This page was built for publication: On repetition-free binary words of minimal density