Computing abelian complexity of binary uniform morphic words

DOI10.1016/j.tcs.2016.05.046zbMath1352.68198OpenAlexW2414300835WikidataQ115036522 ScholiaQ115036522MaRDI QIDQ2629230

Yanyan Li

Publication date: 5 July 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.05.046

zbMATH Keywords

automatic sequencesformal languagesmorphic wordsabelian complexity

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata sequences (11B85) Algorithms on strings (68W32)

Related Items (7)

Weighted prefix normal words: mind the gap ⋮ The Frobenius problem for homomorphic embeddings of languages into the integers ⋮ Fast algorithms for abelian periods in words and greatest common divisor queries ⋮ Abelian combinatorics on words: a survey ⋮ Minimal Complexities for Infinite Words Written with d Letters ⋮ On infinite prefix normal words ⋮ On the 2-abelian complexity of generalized Cantor sequences

Cites Work

• Unnamed Item
• Unnamed Item
• On a generalization of abelian equivalence and complexity of infinite words
• Abelian properties of Parry words
• Recurrent words with constant abelian complexity
• On the subword complexity of m-free DOL languages
• Crucial words and the complexity of some extremal problems for sets of prohibited words
• Abelian complexity of infinite words associated with quadratic Parry numbers
• On approximate jumbled pattern matching in strings
• On the subword complexity of DOL languages with a constant distribution
• Scaled and permuted string matching
• Balance and abelian complexity of the Tribonacci word
• On the subword complexity of square-free DOL languages
• Subword complexities of various classes of deterministic developmental languages without interactions
• The abelian complexity of the paperfolding word
• A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
• On the asymptotic abelian complexity of morphic words
• ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS
• Enumeration and Automatic Sequences
• Abelian complexity of minimal subshifts
• Complexité des facteurs des mots infinis engendrés par morphismes itérés
• Automatic Sequences
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
• The subword complexity of fixed points of binary uniform morphisms
• Sequences with minimal block growth

This page was built for publication: Computing abelian complexity of binary uniform morphic words