The three-squares lemma for partial words with one hole
From MaRDI portal
Publication:418740
DOI10.1016/J.TCS.2012.01.012zbMATH Open1250.68215OpenAlexW2020706684WikidataQ124815790 ScholiaQ124815790MaRDI QIDQ418740FDOQ418740
Authors: Robert Mercaş, F. Blanchet-Sadri 
Publication date: 30 May 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.012
Recommendations
Cites Work
- Title not available (Why is that?)
- Uniqueness Theorems for Periodic Functions
- Squares, cubes, and time-space efficient string searching
- How many squares can a string contain?
- A note on the number of squares in a word
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- Counting distinct squares in partial words
- Algorithmic Combinatorics on Partial Words
- A New Periodicity Lemma
- A new approach to the periodicity lemma on strings with holes
- Partial words and a theorem of Fine and Wilf
- Testing primitivity on partial words
- Conjugacy on partial words.
- Fine and Wilf's theorem for partial words with arbitrarily many weak periods
- Periods in partial words: an algorithm
- Equations on partial words
- Partial words and the interaction property of periods
- Interaction properties of relational periods
- Graph connectivity, partial words, and a theorem of Fine and Wilf
Cited In (7)
- Constructing words with high distinct square densities
- A NEW PROOF OF THE THREE-SQUARES LEMMA FOR PARTIAL WORDS WITH ONE HOLE
- The three squares lemma revisited
- The simplest binary word with only three squares
- A note on the number of squares in a partial word with one hole
- Efficient enumeration of non-equivalent squares in partial words with few holes
- Three overlapping squares: the general case characterized \& applications
This page was built for publication: 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 Q418740)
