Abstract
We present a new series of run-rich strings, and give a new lower bound 0.94457567 of the maximum number of runs in a string. We also introduce the general conjecture about a asymptotic behavior of the numbers of runs in the strings defined by any recurrence formula, and show the lower bound can be improved further to 0.94457571235. © Springer-Verlag Berlin Heidelberg 2009.
Cite
CITATION STYLE
Matsubara, W., Kusano, K., Bannai, H., & Shinohara, A. (2009). A series of run-rich strings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5457, pp. 578–587). https://doi.org/10.1007/978-3-642-00982-2_49
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
