Pages that link to "Item:Q1678750"

The following pages link to Growth of power-free languages over large alphabets (Q1678750):

Displaying 10 items.

• Growth properties of power-free languages (Q465700) (← links)
• Growth of power-free languages: numerical and asymptotic bounds (Q610578) (← links)
• Growth rates of complexity of power-free languages (Q986556) (← links)
• Growth rates of power-free languages (Q1037095) (← links)
• Lower-bounds on the growth of power-free languages over large alphabets (Q2230725) (← links)
• On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\) (Q2271420) (← links)
• The undirected repetition threshold and undirected pattern avoidance (Q2662683) (← links)
• (Q3450102) (← links)
• The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ (Q5109538) (← links)
• LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS (Q5247167) (← links)