Pages that link to "Item:Q3532151"
From MaRDI portal
The following pages link to AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING (Q3532151):
Displaying 16 items.
- On the structure of run-maximal strings (Q414413) (← links)
- On the maximal sum of exponents of runs in a string (Q450542) (← links)
- Computing the number of cubic runs in standard Sturmian words (Q496558) (← links)
- Bannai et al. method proves the \(d\)-step conjecture for strings (Q516879) (← links)
- On primary and secondary repetitions in words (Q764340) (← links)
- How many runs can a string contain? (Q935160) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Computing primitively-rooted squares and runs in partial words (Q1678102) (← links)
- The maximal number of cubic runs in a word (Q1757839) (← links)
- Lower bounds for the number of repetitions in 2D strings (Q2146138) (← 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)
