Asymptotic behavior of the numbers of runs and microruns

DOI10.1016/j.ic.2009.02.007zbMath1194.68182OpenAlexW1984386369MaRDI QIDQ1041040

Mathieu Giraud

Publication date: 27 November 2009

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2009.02.007

zbMATH Keywords

asymptotic behaviorword combinatoricsmaximum number of runsmaximal repetitions

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Prefix frequency of lost positions, Unnamed Item, Computing primitively-rooted squares and runs in partial words, The “Runs” Theorem, Three overlapping squares: the general case characterized \& applications

Cites Work

• Maximal repetitions in strings
• How many runs can a string contain?
• The number of runs in a string
• Towards a Solution to the “Runs” Conjecture
• Not So Many Runs in Strings
• Unnamed Item