Avoiding large squares in partial words

DOI10.1016/j.tcs.2011.04.009zbMath1221.68176OpenAlexW2143745995MaRDI QIDQ551207

Robert Mercaş, Ilkyoo Choi, Francine Blanchet-Sadri

Publication date: 14 July 2011

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.009

zbMATH Keywords

cubessquarescombinatorics on wordspartial words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• Unnamed Item
• Avoiding large squares in infinite binary words
• Square-free partial words
• A generalization of Thue freeness for partial words
• On repetitions of blocks in binary sequences
• How many squares must a binary sequence contain?
• On nonrepetitive sequences
• Freeness of partial words
• Sur un théorème de Thue
• A generator of morphisms for infinite words
• Open Problems in Pattern Avoidance
• Algorithmic Combinatorics on Partial Words