3-Abelian Cubes Are Avoidable on Binary Alphabets

DOI10.1007/978-3-642-38771-5_33zbMath1381.68235OpenAlexW2125915764MaRDI QIDQ5300855

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

combinatorics on words\(k\)-abelian equivalencerepetition-freeness

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (5)

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 ⋮ \(k\)-abelian pattern matching ⋮ On some generalizations of abelian power avoidability

This page was built for publication: 3-Abelian Cubes Are Avoidable on Binary Alphabets