On repetition-free binary words of minimal density
From MaRDI portal
Publication:1292490
DOI10.1016/S0304-3975(98)00257-6zbMATH Open0916.68118WikidataQ58064535 ScholiaQ58064535MaRDI QIDQ1292490FDOQ1292490
Authors: Gregory Kucherov, Roman Kolpakov, Yu. V. Tarannikov 
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Avoidable patterns in strings of symbols
- Every binary pattern of length six is avoidable on the two-letter alphabet
- BLOCKING SETS OF TERMS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Repetitions in the Fibonacci infinite word
- Title not available (Why is that?)
- Open Problems in Pattern Avoidance
- Title not available (Why is that?)
- Sur un théorème de Thue
- A linear-time algorithm to decide whether a binary word contains an overlap
- Growth problems for avoidable words
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on decidability questions on presentations of word semigroups
- A periodicity theorem on words and applications
- MUTUALLY AVOIDING TERNARY WORDS OF SMALL EXPONENT
Cited In (21)
- Polynomial versus exponential growth in repetition-free binary words
- Dejean's conjecture and letter frequency
- Avoiding or limiting regularities in words
- Title not available (Why is that?)
- Optimal bounds for the similarity density of the Thue-Morse word with overlap-free and \(\frac73\)-power-free infinite binary words
- Dejean's conjecture and letter frequency
- Avoiding fractional powers over the natural numbers
- Minimal Discriminating Words Problem Revisited
- The minimal density of a letter in an infinite ternary square-free word is 883/3215
- WORDS AVOIDING $\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISM
- On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\)
- Subword complexity and power avoidance
- Infinite words containing squares at every position
- On highly repetitive and power free words
- Growth properties of power-free languages
- Letter frequency in infinite repetition-free words
- Pattern avoidance: themes and variations
- On the tree of binary cube-free words
- On the existence of minimal \(\beta \)-powers
- On the entropy and letter frequencies of powerfree words
- Minimum degree and density of binary sequences
This page was built for publication: On repetition-free binary words of minimal density
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292490)
