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

DOI10.1142/S0129054110007738MaRDI QIDQ3069745zbMATH OpenOpenAlexWikidataFDO

Authors 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

primitivesquarepartial word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• The three-squares lemma for partial words with one hole
• A note on the number of squares in a partial word with one hole
• A periodicity result of partial words with one hole
• Efficient enumeration of non-equivalent squares in partial words with few holes
• Efficient enumeration of non-equivalent squares in partial words with few holes
• On the number of squares in partial words
• On the number of partially abelian square-free words on a three-letter alphabet
• On the number of partially abelian square-free words on a three-letter alphabet
• Minimum number of holes in unavoidable sets of partial words of size three
• Lyndon Words, the Three Squares Lemma, and Primitive Squares

Cites work

• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• A note on the number of squares in a partial word with one hole
• Codes, orderings, and partial words
• How many squares can a string contain?
• On the number of squares in partial words
• Partial words and a theorem of Fine and Wilf
• Squares, cubes, and time-space efficient string searching

Cited in

(2)

• The three-squares lemma for partial words with one hole
• Three overlapping squares: the general case characterized \& applications

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

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