Abstract
In [3], a short and elegant proof was presented showing that a word of length n contains at most n - 3 runs. Here we show, using the same technique and a computer search, that the number of runs in a binary word of length n is at most 22/23n < 0.957n.
Author supplied keywords
Cite
CITATION STYLE
APA
Fischer, J., Holub, Š., I, T., & Lewenstein, M. (2015). Beyond the runs theorem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9309, pp. 277–286). Springer Verlag. https://doi.org/10.1007/978-3-319-23826-5_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free