Pages that link to "Item:Q2575754"
From MaRDI portal
The following pages link to A generalization of repetition threshold (Q2575754):
Displaying 17 items.
- Bounds for the generalized repetition threshold (Q544880) (← links)
- Fewest repetitions versus maximal-exponent powers in infinite binary words (Q650894) (← links)
- On a word avoiding near repeats (Q989452) (← links)
- Avoidability of formulas with two variables (Q1676792) (← 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)
- A generalization of repetition threshold (Q2575754) (← links)
- Doubled patterns with reversal and square-free doubled patterns (Q2699639) (← links)
- A proof of Dejean’s conjecture (Q3168740) (← links)
- Avoiding conjugacy classes on the 5-letter alphabet (Q3298122) (← links)
- A generator of morphisms for infinite words (Q3421905) (← links)
- ON THE REPETITIVITY INDEX OF INFINITE WORDS (Q3636020) (← links)
- Dejean's conjecture holds for N ≥ 27 (Q3653095) (← links)
- Avoiding or Limiting Regularities in Words (Q4613549) (← links)
- (Q5311153) (redirect page) (← links)
