The three-squares lemma for partial words with one hole
From MaRDI portal
Publication:418740
DOI10.1016/j.tcs.2012.01.012zbMath1250.68215OpenAlexW2020706684WikidataQ124815790 ScholiaQ124815790MaRDI QIDQ418740
Robert Mercaş, Francine 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
Related Items
Constructing Words with High Distinct Square Densities, Efficient enumeration of non-equivalent squares in partial words with few holes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach to the periodicity lemma on strings with holes
- Testing primitivity on partial words
- Graph connectivity, partial words, and a theorem of Fine and Wilf
- How many squares can a string contain?
- Partial words and a theorem of Fine and Wilf
- Conjugacy on partial words.
- Squares, cubes, and time-space efficient string searching
- 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
- 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
- Algorithmic Combinatorics on Partial Words
- Uniqueness Theorems for Periodic Functions
- A New Periodicity Lemma
