A1 Journal article – refereed
5-Abelian cubes are avoidable on binary alphabets




List of Authors: Mercas R, Saarela A
Publisher: EDP Sciences
Publication year: 2014
Journal: RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
Journal name in source: RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS
Journal acronym: RAIRO-Theor. Inf. Appl.
Volume number: 48
Issue number: 4
ISSN: 0988-3754

Abstract


A k-abelian cube is a word uvw, where the factors u, v, and w are either pairwise equal, or have the same multiplicities for every one of their factors of length at most k. Previously it has been shown that k-abelian cubes are avoidable over a binary alphabet for k >= 8. Here it is proved that this holds for k >= 5.




Internal Authors/Editors

Downloadable publication

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.




Last updated on 2019-20-07 at 09:48