AVOIDING APPROXIMATE SQUARES

DOI10.1142/S0129054108005863MaRDI QIDQ3538854zbMATH OpenOpenAlexFDO

Authors Pascal Ochem, Narad Rampersad, Jeffrey 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)

Recommendations

• Avoiding Approximate Squares
• scientific article; zbMATH DE number 4041316
• Characterization of some binary words with few squares
• scientific article; zbMATH DE number 2051164
• How far away must forced letters be so that squares are still avoidable?

Cites work

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

Cited in

(4)

• Mesosome avoidance
• Optimal bounds for the similarity density of the Thue-Morse word with overlap-free and \(\frac73\)-power-free infinite binary words
• Relations on words
• Avoiding Approximate Squares

This page was built for publication: AVOIDING APPROXIMATE SQUARES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3538854)