Pages that link to "Item:Q1268630"
From MaRDI portal
The following pages link to How many squares can a string contain? (Q1268630):
Displaying 13 items.
- Efficient representation and counting of antipower factors in words (Q5919279) (← links)
- Shortest covers of all cyclic shifts of a string (Q5925516) (← links)
- Simple and flexible detection of contiguous repeats using a suffix tree (Q5958334) (← links)
- Efficient enumeration of non-equivalent squares in partial words with few holes (Q5971176) (← links)
- The square density of words having a sequence of FS-double squares (Q6069178) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- Finite and infinite closed-rich words (Q6140350) (← links)
- (Q6150948) (← links)
- Density of distinct squares in non-primitive words (Q6161432) (← links)
- An upper bound of the number of distinct powers in binary words (Q6197757) (← links)
- Lyndon Words, the Three Squares Lemma, and Primitive Squares (Q6485944) (← links)
- On longest common property preserved substring queries (Q6536252) (← links)
- A note on the maximum number of \(k\)-powers in a finite word (Q6614167) (← links)
