Computing abelian complexity of binary uniform morphic words
From MaRDI portal
Recommendations
- On the asymptotic abelian complexity of morphic words
- On the asymptotic abelian complexity of morphic words
- Asymptotic abelian complexities of certain morphic binary words
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
- Abelian complexity of Thue-Morse word over a ternary alphabet
- Abelian maximal pattern complexity of words
- On the 2-abelian complexity of the Thue-Morse word
- The abelian complexity of infinite words and the Frobenius problem
- On abelian and additive complexity in infinite words
Cites work
- A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
- Abelian complexity of fixed point of morphism 0 012, 1 02, 2 1
- Abelian complexity of infinite words associated with quadratic Parry numbers
- Abelian complexity of minimal subshifts
- Abelian properties of Parry words
- Algorithms for jumbled pattern matching in strings
- Automatic Sequences
- Balance and abelian complexity of the Tribonacci word
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- Crucial words and the complexity of some extremal problems for sets of prohibited words
- Enumeration and automatic sequences
- Enumeration and decidable properties of automatic sequences
- On a generalization of abelian equivalence and complexity of infinite words
- On approximate jumbled pattern matching in strings
- On the asymptotic abelian complexity of morphic words
- On the subword complexity of DOL languages with a constant distribution
- On the subword complexity of m-free DOL languages
- On the subword complexity of square-free DOL languages
- Recurrent words with constant abelian complexity
- Scaled and permuted string matching
- Sequences with minimal block growth
- Subword complexities of various classes of deterministic developmental languages without interactions
- The abelian complexity of the paperfolding word
- The subword complexity of fixed points of binary uniform morphisms
- Ultimately constant abelian complexity of infinite words
Cited in
(21)- The Frobenius problem for homomorphic embeddings of languages into the integers
- On the k-abelian complexity of the Cantor sequence
- On the 2-abelian complexity of generalized Cantor sequences
- On the asymptotic abelian complexity of morphic words
- On the abelian complexity of generalized Thue-Morse sequences
- Fast algorithms for abelian periods in words and greatest common divisor queries
- Abelian properties of Parry words
- On factor complexity of morphic sequences
- Abelian complexity and synchronization
- The abelian complexity of infinite words and the Frobenius problem
- Abelian maximal pattern complexity of words
- On the computational complexity of the Arnold complexity of binary words
- Asymptotic abelian complexities of certain morphic binary words
- On the asymptotic abelian complexity of morphic words
- Abelian complexity of fixed point of morphism 0 012, 1 02, 2 1
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- On infinite prefix normal words
- Abelian combinatorics on words: a survey
- Minimal Complexities for Infinite Words Written with d Letters
- Weighted prefix normal words
- Weighted prefix normal words: mind the gap
This page was built for publication: Computing abelian complexity of binary uniform morphic words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629230)
