A Series of Run-Rich Strings.
Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings,
, pp.578-587
(2009), [peer-reviewed]
Event Date:
April 2-8, 2009
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,…