The following pages link to The number of runs in a string (Q2381507):
Displaying 28 items.
- On the maximal sum of exponents of runs in a string (Q450542) (← links)
- On the density of Lyndon roots in factors (Q507403) (← links)
- Bannai et al. method proves the \(d\)-step conjecture for strings (Q516879) (← links)
- The ``runs'' conjecture (Q544875) (← links)
- Counting maximal-exponent factors in words (Q728262) (← links)
- On primary and secondary repetitions in words (Q764340) (← links)
- Computing maximal-exponent factors in an overlap-free word (Q899581) (← links)
- How many runs can a string contain? (Q935160) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Asymptotic behavior of the numbers of runs and microruns (Q1041040) (← links)
- Computing primitively-rooted squares and runs in partial words (Q1678102) (← links)
- Crochemore's partitioning on weighted strings and applications (Q1709578) (← links)
- The maximal number of cubic runs in a word (Q1757839) (← links)
- On the maximum number of cubic subwords in a word (Q1761496) (← links)
- Lower bounds for the number of repetitions in 2D strings (Q2146138) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- Some results on the number of periodic factors in words (Q2288207) (← links)
- Prefix frequency of lost positions (Q2358696) (← links)
- On the average number of regularities in a word (Q2437740) (← links)
- ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS (Q2909197) (← links)
- On the Maximal Sum of Exponents of Runsin a String (Q3000489) (← links)
- Towards a Solution to the “Runs” Conjecture (Q3506961) (← links)
- Bounds on Powers in Strings (Q3533012) (← links)
- Not So Many Runs in Strings (Q3540112) (← links)
- NUMBER OF OCCURRENCES OF POWERS IN STRINGS (Q3586403) (← links)
- A Series of Run-Rich Strings (Q3618614) (← links)
- AVERAGE VALUE OF SUM OF EXPONENTS OF RUNS IN A STRING (Q3655541) (← links)
- (Q5874500) (← links)
