5-Abelian cubes are avoidable on binary alphabets

DOI10.1051/ITA/2014020zbMath1302.68229OpenAlexW1976449761MaRDI QIDQ2934279

Aleksi Saarela, Robert Mercaş

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

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

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (4)

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

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