Pages that link to "Item:Q2629230"
From MaRDI portal
The following pages link to Computing abelian complexity of binary uniform morphic words (Q2629230):
Displaying 15 items.
- Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) (← links)
- Abelian properties of Parry words (Q484315) (← links)
- Weighted prefix normal words: mind the gap (Q832931) (← 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 the 2-abelian complexity of generalized Cantor sequences (Q2087468) (← links)
- On the asymptotic abelian complexity of morphic words (Q2406541) (← links)
- On the abelian complexity of generalized Thue-Morse sequences (Q2420616) (← links)
- Abelian Complexity and Synchronization (Q4987418) (← links)
- The abelian complexity of infinite words and the Frobenius problem (Q4987432) (← links)
- Abelian maximal pattern complexity of words (Q5175078) (← links)
- Abelian complexity of fixed point of morphism \(0 \mapsto 012, 1 \mapsto 02, 2 \mapsto 1\) (Q5408177) (← links)
- Computing the \(k\)-binomial complexity of the Thue-Morse word (Q5918904) (← links)
- On infinite prefix normal words (Q5919082) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
