Pages that link to "Item:Q991771"
From MaRDI portal
The following pages link to On maximal repetitions of arbitrary exponent (Q991771):
Displaying 7 items.
- The complexity of smooth words on 2-letter alphabets (Q653325) (← links)
- Upper bounds on distinct maximal (sub-)repetitions in compressed strings (Q832954) (← links)
- Computing maximal-exponent factors in an overlap-free word (Q899581) (← links)
- Searching of gapped repeats and subrepetitions in a word (Q1679608) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- Some results on the number of periodic factors in words (Q2288207) (← links)
- Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings (Q6169968) (← links)
