A NEW PROOF OF THE THREE-SQUARES LEMMA FOR PARTIAL WORDS WITH ONE HOLE
From MaRDI portal
Publication:3069745
DOI10.1142/S0129054110007738zbMATH Open1208.68165OpenAlexW2081779763WikidataQ124906600 ScholiaQ124906600MaRDI QIDQ3069745FDOQ3069745
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
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
- Title not available (Why is that?)
- Squares, cubes, and time-space efficient string searching
- How many squares can a string contain?
- Partial words and a theorem of Fine and Wilf
- Codes, orderings, and partial words
- On the number of squares in partial words
- A note on the number of squares in a partial word with one hole
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)
