A series of run-rich strings

Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings
Pages578-587
Number of pages10
DOIs
Publication statusPublished - Jul 13 2009
Event3rd International Conference on Language and Automata Theory and Applications, LATA 2009 - Tarragona, Spain
Duration: Apr 2 2009Apr 8 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5457
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd International Conference on Language and Automata Theory and Applications, LATA 2009
CountrySpain
CityTarragona
Period4/2/094/8/09

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A series of run-rich strings'. Together they form a unique fingerprint.

  • Cite this

    Matsubara, W., Kusano, K., Bannai, H., & Shinohara, A. (2009). A series of run-rich strings. In Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings (pp. 578-587). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5457). https://doi.org/10.1007/978-3-642-00982-2_49