3-abelian cubes are avoidable on binary alphabets

DOI10.1007/978-3-642-38771-5_33MaRDI QIDQ5300855zbMATH OpenOpenAlexFDO

Authors Robert Mercaş, Aleksi Saarela

Publication date 28 June 2013

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2014__48_4_467_0/

zbMATH Keywords

\(k\)-abelian equivalencecombinatorics on wordsrepetition-freeness

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• 5-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

(13)

• Syntactic semigroups of avoided languages
• On growth and fluctuation of k-abelian complexity
• Existence of an infinite ternary 64-abelian square-free word
• 5-abelian cubes are avoidable on binary alphabets
• The avoidability of cubes under permutations
• On growth and fluctuation of \(k\)-abelian complexity
• On \(k\)-abelian avoidability
• On a generalization of abelian equivalence and complexity of infinite words
• \(k\)-abelian pattern matching
• On some generalizations of abelian power avoidability
• Avoidability of Additive Cubes over Alphabets of Four Numbers
• Avoidability of long k-abelian repetitions
• Problems in between words and abelian words: \(k\)-abelian avoidability

This page was built for publication: 3-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 Q5300855)