Recommendations
Cites work
- A note on the number of squares in a partial word with one hole
- 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
- Algorithmic Combinatorics on Partial Words
- Counting distinct squares in partial words
- How many square occurrences must a binary sequence contain?
- How many squares can a string contain?
- How many squares must a binary sequence contain?
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- Letter frequency in infinite repetition-free words
- On the number of squares in partial words
- Squares in binary partial words
- The number of positions starting a square in binary words
Cited in
(18)- Computing primitively-rooted squares and runs in partial words
- Partial words with a unique position starting a square
- Squares and primitivity in partial words
- Computing primitively-rooted squares and runs in partial words
- Maximum number of distinct and nonequivalent nonstandard squares in a word
- Squares in binary partial words
- Squareable words
- A note on the number of squares in a partial word with one hole
- The three-squares lemma for partial words with one hole
- Square-free partial words with many wildcards
- Constructing words with high distinct square densities
- Infinite words containing squares at every position
- On the number of squares in partial words
- Counting distinct squares in partial words
- Avoiding large squares in partial words
- Efficient enumeration of non-equivalent squares in partial words with few holes
- The number of positions starting a square in binary words
- Square-free partial words
This page was built for publication: Squares in partial words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2440165)
