Not So Many Runs in Strings

DOI10.1007/978-3-540-88282-4_22zbMath1156.68511OpenAlexW1529898278MaRDI QIDQ3540112

Mathieu Giraud

Publication date: 20 November 2008

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88282-4_22

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (23)

Lower bounds for the number of repetitions in 2D strings ⋮ Computing primitively-rooted squares and runs in partial words ⋮ The total run length of a word ⋮ Towards a Solution to the “Runs” Conjecture ⋮ On the structure of run-maximal strings ⋮ The three squares lemma revisited ⋮ The “Runs” Theorem ⋮ Unnamed Item ⋮ On the average number of regularities in a word ⋮ On the maximal sum of exponents of runs in a string ⋮ Bounds on Powers in Strings ⋮ On the Maximal Sum of Exponents of Runsin a String ⋮ Bannai et al. method proves the \(d\)-step conjecture for strings ⋮ The maximal number of cubic runs in a word ⋮ Computing regularities in strings: a survey ⋮ On the maximum number of cubic subwords in a word ⋮ The ``runs conjecture ⋮ Some results on the number of periodic factors in words ⋮ A Series of Run-Rich Strings ⋮ On primary and secondary repetitions in words ⋮ Repetitions in strings: algorithms and combinatorics ⋮ Asymptotic behavior of the numbers of runs and microruns ⋮ Three overlapping squares: the general case characterized \& applications

Cites Work

• Unnamed Item
• Maximal repetitions in strings
• How many runs can a string contain?
• The number of runs in a string

This page was built for publication: Not So Many Runs in Strings