Pages that link to "Item:Q2934276"
From MaRDI portal
The following pages link to Finite repetition threshold for large alphabets (Q2934276):
Displaying 10 items.
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters (Q650879) (← links)
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots (Q792102) (← links)
- Computing maximal-exponent factors in an overlap-free word (Q899581) (← links)
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters (Q1184978) (← links)
- Abelian repetition threshold revisited (Q2097234) (← links)
- Letter frequency in infinite repetition-free words (Q2373761) (← links)
- Avoiding letter patterns in ternary square-free words (Q2635082) (← links)
- Finite-repetition threshold for infinite ternary words (Q2789511) (← links)
- (Q3766559) (← links)
- Avoiding or Limiting Regularities in Words (Q4613549) (← links)