Pages that link to "Item:Q792102"
From MaRDI portal
The following pages link to A propos d'une conjecture de F. Dejean sur les répétitions dans les mots (Q792102):
Displaying 50 items.
- A ternary square-free sequence avoiding factors equivalent to \(abcacba\) (Q289989) (← links)
- Minimal critical exponent of quasiperiodic words (Q401485) (← links)
- Growth properties of power-free languages (Q465700) (← links)
- Bounds for the generalized repetition threshold (Q544880) (← links)
- Last cases of Dejean's conjecture (Q544887) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters (Q650879) (← links)
- Branching frequency and Markov entropy of repetition-free languages (Q832956) (← links)
- Dejean's conjecture and Sturmian words (Q872047) (← links)
- On a word avoiding near repeats (Q989452) (← links)
- Every real number greater than 1 is a critical exponent (Q995572) (← links)
- Repetition-free words (Q1078338) (← links)
- Multidimensional unrepetitive configurations (Q1106022) (← links)
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters (Q1184978) (← links)
- On repeated factors in \(C^\infty\)-words (Q1342256) (← links)
- On repetition thresholds of caterpillars and trees of bounded degree (Q1753030) (← links)
- Words strongly avoiding fractional powers (Q1970068) (← links)
- Abelian repetition threshold revisited (Q2097234) (← links)
- Extremal overlap-free and extremal \(\beta\)-free binary words (Q2215463) (← links)
- Dejean's conjecture holds for \(n\geq 30\) (Q2271427) (← links)
- Repetition avoidance in products of factors (Q2272409) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- Letter frequency in infinite repetition-free words (Q2373761) (← links)
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture (Q2420559) (← links)
- On Dejean's conjecture over large alphabets (Q2456366) (← links)
- Growth of repetition-free words -- a review (Q2484440) (← links)
- A generalization of repetition threshold (Q2575754) (← links)
- Avoiding letter patterns in ternary square-free words (Q2635082) (← links)
- The undirected repetition threshold and undirected pattern avoidance (Q2662683) (← links)
- On minimal critical exponent of balanced sequences (Q2672583) (← links)
- ON PANSIOT WORDS AVOIDING 3-REPETITIONS (Q2841970) (← links)
- On the D0L Repetition Threshold (Q3060199) (← links)
- A proof of Dejean’s conjecture (Q3168740) (← links)
- A generator of morphisms for infinite words (Q3421905) (← links)
- On the Tree of Ternary Square-Free Words (Q3449372) (← links)
- On extremal properties of the Fibonacci word (Q3537492) (← links)
- AVOIDING APPROXIMATE SQUARES (Q3538854) (← links)
- ON THE REPETITIVITY INDEX OF INFINITE WORDS (Q3636020) (← links)
- Dejean's conjecture holds for N ≥ 27 (Q3653095) (← links)
- The weak circular repetition threshold over large alphabets (Q5021102) (← links)
- Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters (Q5041268) (← links)
- The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ (Q5109538) (← links)
- The repetition threshold for binary rich words (Q5130737) (← links)
- On the growth rates of complexity of threshold languages (Q5190085) (← links)
- INNER PALINDROMIC CLOSURE (Q5247174) (← links)
- Asymptotic repetitive threshold of balanced sequences (Q5879125) (← links)
- Dejean's conjecture and letter frequency (Q5899396) (← links)
- Dejean's conjecture and letter frequency (Q5900364) (← links)
- Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings (Q6169968) (← links)
- Extensions and reductions of squarefree words (Q6177427) (← links)
