A cyclic binary morphism avoiding abelian fourth powers

DOI10.1016/j.tcs.2008.09.027zbMath1161.68044OpenAlexW2029064195MaRDI QIDQ1001897

Ali Aberkane, James D. Currie

Publication date: 19 February 2009

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

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

zbMATH Keywords

combinatorics on wordsabelian repetitionsnon-repetitive words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (7)

A powerful abelian square-free substitution over 4 letters ⋮ Fast algorithms for abelian periods in words and greatest common divisor queries ⋮ Fixed points avoiding abelian \(k\)-powers ⋮ Abelian repetitions in partial words ⋮ IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS ⋮ Unnamed Item ⋮ Templates for the \(k\)-binomial complexity of the Tribonacci word

Cites Work

• Pattern avoidance: themes and variations
• The number of binary words avoiding Abelian fourth powers grows exponentially
• Growth problems for avoidable words
• Strongly non-repetitive sequences and progression-free sets
• Avoiding Patterns in the Abelian Sense
• BLOCKING SETS OF TERMS
• Automatic Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A cyclic binary morphism avoiding abelian fourth powers