Repetition avoidance in products of factors

DOI10.1016/J.TCS.2019.04.013zbMath1431.68103arXiv1809.01426OpenAlexW2889985600WikidataQ127865777 ScholiaQ127865777MaRDI QIDQ2272409

Pamela Fleischmann, Kamellia Reshadi, Pascal Ochem

Publication date: 10 September 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.01426

zbMATH Keywords

combinatorics on wordsrepetition avoidance

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Last cases of Dejean's conjecture
• Substitutions in dynamics, arithmetics and combinatorics
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• On Dejean's conjecture over large alphabets
• Sur un théorème de Thue
• A generator of morphisms for infinite words
• Repetition Avoidance in Circular Factors

This page was built for publication: Repetition avoidance in products of factors