Pages that link to "Item:Q650879"
From MaRDI portal
The following pages link to On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters (Q650879):
Displaying 9 items.
- Growth properties of power-free languages (Q465700) (← links)
- Branching frequency and Markov entropy of repetition-free languages (Q832956) (← links)
- Enumeration of irreducible binary words (Q1121031) (← links)
- Avoidability of circular formulas (Q1743715) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- Doubled patterns are 3-avoidable (Q2635083) (← 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)
- Transition property for cube-free words (Q5918354) (← links)
