How many runs can a string contain?

DOI10.1016/j.tcs.2008.04.020zbMath1155.68070MaRDI QIDQ935160

W. F. Smyth, Simon J. Puglisi, R. Jamie Simpson

Publication date: 31 July 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://researchrepository.murdoch.edu.au/id/eprint/27960/

zbMATH Keywords

periodicity; repetition; string; run

Mathematics Subject Classification ID

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, On the density of Lyndon roots in factors, Bannai et al. method proves the \(d\)-step conjecture for strings, The ``runs conjecture, On primary and secondary repetitions in words, Maximal repetitions in strings, 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, Optimal bounds for computing \({\alpha}\)-gapped repeats, Some results on the number of periodic factors in words, Three overlapping squares: the general case characterized \& applications, Prefix frequency of lost positions, 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, Not So Many Runs in Strings, A Series of Run-Rich Strings, AVERAGE VALUE OF SUM OF EXPONENTS OF RUNS IN A STRING

Cites Work