5-abelian cubes are avoidable on binary alphabets

DOI10.1051/ITA/2014020MaRDI QIDQ2934279zbMATH OpenOpenAlexFDO

Authors Robert Mercaş, Aleksi Saarela

Publication date 12 December 2014

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/3047bf6da7e9e1652699f2cba5f8c1037dd7b116

zbMATH Keywords

\(k\)-abelian cubescombinatorics on wordscube-freenessequivalencerepetition-freeness

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• 3-abelian cubes are avoidable on binary alphabets
• On some generalizations of abelian power avoidability
• Problems in between words and abelian words: \(k\)-abelian avoidability
• On \(k\)-abelian avoidability
• Crucial Words for Abelian Powers

Cited in

(9)

• Syntactic semigroups of avoided languages
• Avoiding 5/4-powers on the alphabet of nonnegative integers
• On growth and fluctuation of k-abelian complexity
• On growth and fluctuation of \(k\)-abelian complexity
• On a generalization of abelian equivalence and complexity of infinite words
• On some generalizations of abelian power avoidability
• Avoidability of Additive Cubes over Alphabets of Four Numbers
• 3-abelian cubes are avoidable on binary alphabets
• Avoidability of long k-abelian repetitions

This page was built for publication: 5-abelian cubes are avoidable on binary alphabets

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