A NEW PROOF OF THE THREE-SQUARES LEMMA FOR PARTIAL WORDS WITH ONE HOLE

DOI10.1142/S0129054110007738zbMath1208.68165OpenAlexW2081779763WikidataQ124906600 ScholiaQ124906600MaRDI QIDQ3069745

Tomi Kärki

Publication date: 19 January 2011

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

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

zbMATH Keywords

squareprimitivepartial word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• Codes, orderings, and partial words
• How many squares can a string contain?
• Partial words and a theorem of Fine and Wilf
• Squares, cubes, and time-space efficient string searching
• A note on the number of squares in a partial word with one hole
• On the number of squares in partial words

This page was built for publication: A NEW PROOF OF THE THREE-SQUARES LEMMA FOR PARTIAL WORDS WITH ONE HOLE