Pages that link to "Item:Q4650104"
From MaRDI portal
The following pages link to On Abelian and Additive Complexity in Infinite Words (Q4650104):
Displaying 14 items.
- Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
- On complexity functions of infinite words associated with generalized Dyck languages (Q954986) (← links)
- The Frobenius problem for homomorphic embeddings of languages into the integers (Q1637229) (← links)
- On the additive complexity of a Thue-Morse-like sequence (Q1741501) (← links)
- Permutations destroying arithmetic structure (Q2341051) (← links)
- On the asymptotic abelian complexity of morphic words (Q2406541) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- Abelian complexity and frequencies of letters in infinite words (Q2833546) (← links)
- (Q3115565) (← links)
- Approximations of Additive Squares in Infinite Words (Q4650105) (← links)
- (Q4830987) (← links)
- The abelian complexity of infinite words and the Frobenius problem (Q4987432) (← links)
- Sturmian words and constant additive complexity (Q5262049) (← links)
- On additive complexity of infinite words (Q5404275) (← links)