A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
From MaRDI portal
Publication:792102
DOI10.1016/0166-218X(84)90006-4zbMATH Open0536.68072WikidataQ57253992 ScholiaQ57253992MaRDI QIDQ792102FDOQ792102
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Formal languages and automata (68Q45) Artificial intelligence (68T99) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Title not available (Why is that?)
- Uniformly growing k-th power-free homomorphisms
- Title not available (Why is that?)
- Subword complexities of various classes of deterministic developmental languages without interactions
- Sur un théorème de Thue
- Unending chess, symbolic dynamics and a problem in semi-groups
- On repetitions of blocks in binary sequences
- On the subword complexity of square-free DOL languages
- Mots sans carre et morphismes iterés
- Title not available (Why is that?)
Cited In (57)
- A small morphism for which the fixed point has an abelian critical exponent less than 2
- The repetition threshold of episturmian sequences
- Extensions and reductions of squarefree words
- An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence
- Approaching repetition thresholds via local resampling and entropy compression
- Non-constructive upper bounds for repetition thresholds
- Minimal critical exponent of quasiperiodic words
- ON THE REPETITIVITY INDEX OF INFINITE WORDS
- On the D0L Repetition Threshold
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
- Branching frequency and Markov entropy of repetition-free languages
- Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters
- Last cases of Dejean's conjecture
- On repeated factors in \(C^\infty\)-words
- Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings
- Asymptotic repetitive threshold of balanced sequences
- The undirected repetition threshold and undirected pattern avoidance
- Bounds for the generalized repetition threshold
- Dejean's conjecture and Sturmian words
- Dejean's conjecture and letter frequency
- On minimal critical exponent of balanced sequences
- Dejean's conjecture and letter frequency
- Every real number greater than 1 is a critical exponent
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- On repetition thresholds of caterpillars and trees of bounded degree
- A ternary square-free sequence avoiding factors equivalent to \(abcacba\)
- Subword complexity and power avoidance
- AVOIDING APPROXIMATE SQUARES
- Dejean's conjecture holds for \(n\geq 30\)
- Une extension d'un théorème de P. Jullien sur les âges de mots
- The weak circular repetition threshold over large alphabets
- On a word avoiding near repeats
- On the growth rates of complexity of threshold languages
- On Dejean's conjecture over large alphabets
- The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$
- Growth properties of power-free languages
- Letter frequency in infinite repetition-free words
- Words strongly avoiding fractional powers
- Repetition avoidance in products of factors
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
- A generalization of repetition threshold
- Growth of repetition-free words -- a review
- A proof of Dejean’s conjecture
- A generator of morphisms for infinite words
- On extremal properties of the Fibonacci word
- Repetition-free words
- Extremal overlap-free and extremal \(\beta\)-free binary words
- Dejean's conjecture holds for N ≥ 27
- On Pnsiot words avoiding 3-repetitions
- Pattern avoidance: themes and variations
- Critical Exponents of Regular Arnoux-Rauzy Sequences
- Avoiding letter patterns in ternary square-free words
- INNER PALINDROMIC CLOSURE
- The repetition threshold for binary rich words
- Multidimensional unrepetitive configurations
- Abelian repetition threshold revisited
- On the Tree of Ternary Square-Free Words
This page was built for publication: A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792102)
