Pages that link to "Item:Q5109538"
From MaRDI portal
The following pages link to The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ (Q5109538):
Displaying 5 items.
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters (Q650879) (← links)
- Abelian repetition threshold revisited (Q2097234) (← links)
- Complementary symmetric Rote sequences: the critical exponent and the recurrence function (Q3386617) (← links)
- The weak circular repetition threshold over large alphabets (Q5021102) (← links)
- The lexicographically least binary rich word achieving the repetition threshold (Q6671609) (← links)