On the asymptotic abelian complexity of morphic words
From MaRDI portal
Publication:2406541
DOI10.1016/j.aam.2014.08.005zbMath1371.68220OpenAlexW1987700418MaRDI QIDQ2406541
Nathan Fox, Narad Rampersad, Francine Blanchet-Sadri
Publication date: 5 October 2017
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2014.08.005
combinatorics on wordsmorphic wordsabelian complexityuniform morphismsfactorization of morphismsParry morphismssturmian morphisms
Related Items (9)
Computing abelian complexity of binary uniform morphic words ⋮ The abelian complexity of infinite words and the Frobenius problem ⋮ On the \(k\)-abelian complexity of the Cantor sequence ⋮ Abelian combinatorics on words: a survey ⋮ Minimal Complexities for Infinite Words Written with d Letters ⋮ Abelian properties of Parry words ⋮ Abelian closures of infinite binary words ⋮ Abelian antipowers in infinite words ⋮ On infinite prefix normal words
Cites Work
- Unnamed Item
- Unnamed Item
- Recurrent words with constant abelian complexity
- On the subword complexity of m-free DOL languages
- Abelian complexity of infinite words associated with quadratic Parry numbers
- On the subword complexity of DOL languages with a constant distribution
- On the subword complexity of square-free DOL languages
- Subword complexities of various classes of deterministic developmental languages without interactions
- Balances for fixed points of primitive substitutions.
- Symbolic discrepancy and self-similar dynamics.
- Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words
- Abelian complexity of minimal subshifts
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- Automatic Sequences
- The subword complexity of fixed points of binary uniform morphisms
- On the Asymptotic Abelian Complexity of Morphic Words
- Sequences with minimal block growth
This page was built for publication: On the asymptotic abelian complexity of morphic words
