A Series of Run-Rich Strings

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.

• Type: Conference
• Year: 2009
• Where: LATA
• Authors: Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara
• Keywords: Automata Theory, LATA 2009, Lower Bound, Maximum Number, Run-rich Strings