Not So Many Runs in Strings
From MaRDI portal
Publication:3540112
DOI10.1007/978-3-540-88282-4_22zbMath1156.68511MaRDI QIDQ3540112
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
68R15: Combinatorics on words
Related Items
The “Runs” Theorem, Unnamed Item, The total run length of a word, On the structure of run-maximal strings, The three squares lemma revisited, On the maximal sum of exponents of runs in a string, Bannai et al. method proves the \(d\)-step conjecture for strings, The ``runs conjecture, On primary and secondary repetitions in words, Repetitions in strings: algorithms and combinatorics, Asymptotic behavior of the numbers of runs and microruns, Computing primitively-rooted squares and runs in partial words, 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, Lower bounds for the number of repetitions in 2D strings, Some results on the number of periodic factors in words, Three overlapping squares: the general case characterized \& applications, On the average number of regularities in a word, On the Maximal Sum of Exponents of Runsin a String, Towards a Solution to the “Runs” Conjecture, Bounds on Powers in Strings, A Series of Run-Rich Strings
Cites Work
