A cyclic binary morphism avoiding abelian fourth powers

DOI10.1016/J.TCS.2008.09.027MaRDI QIDQ1001897zbMATH OpenOpenAlexFDO

Authors James D. Currie, Ali Aberkane

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)

Cites work

• scientific article; zbMATH DE number 3162927 (Why is no real title available?)
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 1740032 (Why is no real title available?)
• scientific article; zbMATH DE number 2051154 (Why is no real title available?)
• scientific article; zbMATH DE number 3375509 (Why is no real title available?)
• Automatic Sequences
• Avoiding patterns in the abelian sense
• BLOCKING SETS OF TERMS
• Growth problems for avoidable words
• Pattern avoidance: themes and variations
• Strongly non-repetitive sequences and progression-free sets
• The number of binary words avoiding Abelian fourth powers grows exponentially

Cited in

(7)

• Abelian repetitions in partial words
• Fixed points avoiding abelian k-powers
• Templates for the \(k\)-binomial complexity of the Tribonacci word
• scientific article; zbMATH DE number 7559450 (Why is no real title available?)
• Fast algorithms for abelian periods in words and greatest common divisor queries
• A powerful abelian square-free substitution over 4 letters
• Identifying all abelian periods of a string in quadratic time and relevant problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1001897)