On repetition-free binary words of minimal density
From MaRDI portal
(Redirected from Publication:1292490)
Recommendations
Cites work
- scientific article; zbMATH DE number 992016 (Why is no real title available?)
- scientific article; zbMATH DE number 3767067 (Why is no real title available?)
- scientific article; zbMATH DE number 492720 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 1361493 (Why is no real title available?)
- A linear-time algorithm to decide whether a binary word contains an overlap
- A note on decidability questions on presentations of word semigroups
- A periodicity theorem on words and applications
- Avoidable patterns in strings of symbols
- BLOCKING SETS OF TERMS
- Every binary pattern of length six is avoidable on the two-letter alphabet
- Growth problems for avoidable words
- MUTUALLY AVOIDING TERNARY WORDS OF SMALL EXPONENT
- Open Problems in Pattern Avoidance
- Repetitions in the Fibonacci infinite word
- Sur un théorème de Thue
Cited in
(21)- Dejean's conjecture and letter frequency
- Growth properties of power-free languages
- Pattern avoidance: themes and variations
- Letter frequency in infinite repetition-free words
- On the entropy and letter frequencies of powerfree words
- Minimal Discriminating Words Problem Revisited
- Avoiding or limiting regularities in words
- scientific article; zbMATH DE number 1919522 (Why is no real title available?)
- On highly repetitive and power free words
- Infinite words containing squares at every position
- Optimal bounds for the similarity density of the Thue-Morse word with overlap-free and \(\frac73\)-power-free infinite binary words
- The minimal density of a letter in an infinite ternary square-free word is 883/3215
- On the existence of minimal \(\beta \)-powers
- WORDS AVOIDING $\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISM
- Minimum degree and density of binary sequences
- Dejean's conjecture and letter frequency
- On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\)
- Subword complexity and power avoidance
- Polynomial versus exponential growth in repetition-free binary words
- Avoiding fractional powers over the natural numbers
- On the tree of binary cube-free words
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)
