Pages that link to "Item:Q5190085"
From MaRDI portal
The following pages link to On the growth rates of complexity of threshold languages (Q5190085):
Displayed 10 items.
- Growth properties of power-free languages (Q465700) (← links)
- Branching frequency and Markov entropy of repetition-free languages (Q832956) (← links)
- Growth of power-free languages over large alphabets (Q1678750) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- On minimal critical exponent of balanced sequences (Q2672583) (← links)
- ON PANSIOT WORDS AVOIDING 3-REPETITIONS (Q2841970) (← links)
- ON THE EXISTENCE OF MINIMAL β-POWERS (Q2909104) (← links)
- A proof of Dejean’s conjecture (Q3168740) (← links)
- Avoiding or Limiting Regularities in Words (Q4613549) (← links)
- The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ (Q5109538) (← links)