On the asymptotic abelian complexity of morphic words
From MaRDI portal
Publication:5300832
Recommendations
- On the asymptotic abelian complexity of morphic words
- Asymptotic abelian complexities of certain morphic binary words
- Computing abelian complexity of binary uniform morphic words
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- On the abelian complexity of generalized Thue-Morse sequences
Cited in
(20)- Abelian complexity of fixed point of morphism \(0 \mapsto 012, 1 \mapsto 02, 2 \mapsto 1\)
- On the asymptotic abelian complexity of morphic words
- Asymptotic properties of free monoid morphisms
- On factor complexity of morphic sequences
- Computing abelian complexity of binary uniform morphic words
- Abelian maximal pattern complexity of words
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- On the abelian complexity of generalized Thue-Morse sequences
- Asymptotic subword complexity of fixed points of group substitutions
- Cyclic Complexity of Words
- Fast algorithms for abelian periods in words and greatest common divisor queries
- Logarithmic equal-letter runs for BWT of purely morphic words
- Asymptotic abelian complexities of certain morphic binary words
- Abelian properties of Parry words
- A characterization of morphic words with polynomial growth
- The subword complexity of fixed points of binary uniform morphisms
- scientific article; zbMATH DE number 6004843 (Why is no real title available?)
- Morphic and automatic words: maximal blocks and Diophantine approximation
- The Lempel-Ziv Complexity of Fixed Points of Morphisms
- The Lempel–Ziv Complexity of Fixed Points of Morphisms
This page was built for publication: On the asymptotic abelian complexity of morphic words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300832)
