Pages that link to "Item:Q872047"

The following pages link to Dejean's conjecture and Sturmian words (Q872047):

Displaying 37 items.

• 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)
• 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)
• On a word avoiding near repeats (Q989452) (← links)
• On repetition thresholds of caterpillars and trees of bounded degree (Q1753030) (← links)
• Extremal overlap-free and extremal \(\beta\)-free binary words (Q2215463) (← links)
• On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\) (Q2271420) (← links)
• Dejean's conjecture holds for \(n\geq 30\) (Q2271427) (← 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)
• 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)
• Highly nonrepetitive sequences: Winning strategies from the local lemma (Q3068764) (← links)
• A proof of Dejean’s conjecture (Q3168740) (← links)
• On extremal properties of the Fibonacci word (Q3537492) (← links)
• AVOIDING APPROXIMATE SQUARES (Q3538854) (← links)
• Least Periods of Factors of Infinite Words (Q3549293) (← 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)
• 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)
• 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)
• An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence (Q6204547) (← links)
• A small morphism for which the fixed point has an abelian critical exponent less than 2 (Q6551808) (← links)
• The repetition threshold of episturmian sequences (Q6568864) (← links)