Pages that link to "Item:Q3074533"
From MaRDI portal
The following pages link to Abelian complexity of minimal subshifts (Q3074533):
Displaying 13 items.
- Abelian powers and repetitions in Sturmian words (Q287434) (← links)
- On a generalization of abelian equivalence and complexity of infinite words (Q388738) (← links)
- Abelian properties of Parry words (Q484315) (← links)
- Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
- Abelian bordered factors and periodicity (Q499493) (← links)
- Relations on words (Q505060) (← links)
- Cyclic complexity of words (Q507796) (← links)
- Recurrent words with constant abelian complexity (Q544139) (← links)
- Abelian complexity of infinite words associated with quadratic Parry numbers (Q653315) (← links)
- Eulerian entropy and non-repetitive subword complexity (Q764367) (← links)
- The Frobenius problem for homomorphic embeddings of languages into the integers (Q1637229) (← links)
- On the \(k\)-abelian complexity of the Cantor sequence (Q1689047) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
