Pages that link to "Item:Q5055933"
From MaRDI portal
The following pages link to The subword complexity of fixed points of binary uniform morphisms (Q5055933):
Displaying 9 items.
- Subword complexity of uniform D0L words over finite groups (Q719314) (← links)
- On the subword complexity of DOL languages with a constant distribution (Q798008) (← links)
- On k-repetition freeness of length uniform morphisms over a binary alphabet (Q799123) (← links)
- On the context-freeness of the set of words containing overlaps (Q845966) (← links)
- Asymptotic subword complexity of fixed points of group substitutions (Q1019186) (← links)
- Ancestors graph and an upper bound for the subword complexity function (Q1935789) (← links)
- On the asymptotic abelian complexity of morphic words (Q2406541) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- Permutation complexity of the fixed points of some uniform binary morphisms (Q2789536) (← links)