Pages that link to "Item:Q5109538"

The following pages link to The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ (Q5109538):

Displaying 3 items.

• 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)