AVOIDING APPROXIMATE SQUARES

DOI10.1142/S0129054108005863zbMath1155.68068OpenAlexW2021056221MaRDI QIDQ3538854

Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit

Publication date: 24 November 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054108005863

zbMATH Keywords

infinite wordsquarefree word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

Relations on words ⋮ Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words ⋮ Mesosome avoidance

Cites Work

• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Dejean's conjecture and Sturmian words
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• On nonrepetitive sequences
• Finding approximate repetitions under Hamming distance.
• Uniformly growing k-th power-free homomorphisms
• On Dejean's conjecture over large alphabets
• Sur un théorème de Thue
• Algorithms For Computing Approximate Repetitions In Musical Sequences

This page was built for publication: AVOIDING APPROXIMATE SQUARES