Pages that link to "Item:Q1162365"
From MaRDI portal
The following pages link to On the subword complexity of square-free DOL languages (Q1162365):
Displaying 20 items.
- On the subword complexity of m-free DOL languages (Q594602) (← links)
- Subword complexity of uniform D0L words over finite groups (Q719314) (← links)
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots (Q792102) (← links)
- On the subword complexity of DOL languages with a constant distribution (Q798008) (← links)
- On regularity of languages generated by copying systems (Q800098) (← links)
- Asymptotic subword complexity of fixed points of group substitutions (Q1019186) (← links)
- On the size of the alphabet and the subword complexity of square-free DOL languages (Q1050120) (← links)
- Repetition-free words (Q1078338) (← links)
- On the subword complexity of locally catenative DOL languages (Q1172397) (← links)
- Repetitiveness of languages generated by morphisms (Q1575438) (← links)
- On cube-free \(\omega\)-words generated by binary morphisms (Q1835915) (← links)
- Uniformly growing k-th power-free homomorphisms (Q1838047) (← links)
- On the asymptotic abelian complexity of morphic words (Q2406541) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- On the D0L Repetition Threshold (Q3060199) (← links)
- A combinatorial theorem on $p$-power-free words and an application to semigroups (Q3479530) (← links)
- (Q3657454) (← links)
- If a DOL language is k-power free then it is circular (Q4630287) (← links)
- Properties of infinite words : Recent results (Q5096141) (← links)
- (Q5132212) (← links)
