The following pages link to (Q3565863):
Displaying 20 items.
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- The total run length of a word (Q391314) (← links)
- On the structure of run-maximal strings (Q414413) (← links)
- On the maximal sum of exponents of runs in a string (Q450542) (← links)
- Average number of occurrences of repetitions in a necklace (Q496552) (← links)
- Computing the number of cubic runs in standard Sturmian words (Q496558) (← links)
- The ``runs'' conjecture (Q544875) (← links)
- On primary and secondary repetitions in words (Q764340) (← links)
- Efficiently computing runs on a trie (Q820550) (← links)
- Computing primitively-rooted squares and runs in partial words (Q1678102) (← links)
- The maximal number of cubic runs in a word (Q1757839) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Lower bounds for the number of repetitions in 2D strings (Q2146138) (← links)
- Some results on the number of periodic factors in words (Q2288207) (← links)
- Three overlapping squares: the general case characterized \& applications (Q2355701) (← links)
- Prefix frequency of lost positions (Q2358696) (← links)
- On the average number of regularities in a word (Q2437740) (← links)
- On the Maximal Sum of Exponents of Runsin a String (Q3000489) (← links)
- The “Runs” Theorem (Q5359492) (← links)
- (Q5874500) (← links)
