A series of run-rich strings

Wataru Matsubara; Kazuhiko Kusano; Hideo Bannai; Ayumi Shinohara

doi:10.1007/978-3-642-00982-2_49

A series of run-rich strings

Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

14 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 language	English
Title of host publication	Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings
Pages	578-587
Number of pages	10
DOIs	https://doi.org/10.1007/978-3-642-00982-2_49
Publication status	Published - 2009
Event	3rd International Conference on Language and Automata Theory and Applications, LATA 2009 - Tarragona, Spain Duration: 2009 Apr 2 → 2009 Apr 8

Publication series

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

Conference

Conference	3rd International Conference on Language and Automata Theory and Applications, LATA 2009
Country/Territory	Spain
City	Tarragona
Period	09/4/2 → 09/4/8

Access to Document

10.1007/978-3-642-00982-2_49

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

@inproceedings{b803af9188094e56a1931425e74eff24,

title = "A series of run-rich strings",

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.",

author = "Wataru Matsubara and Kazuhiko Kusano and Hideo Bannai and Ayumi Shinohara",

year = "2009",

doi = "10.1007/978-3-642-00982-2_49",

language = "English",

isbn = "9783642009815",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "578--587",

booktitle = "Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings",

note = "3rd International Conference on Language and Automata Theory and Applications, LATA 2009 ; Conference date: 02-04-2009 Through 08-04-2009",

}

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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5457, pp. 578-587, 3rd International Conference on Language and Automata Theory and Applications, LATA 2009, Tarragona, Spain, 09/4/2. https://doi.org/10.1007/978-3-642-00982-2_49

A series of run-rich strings. / Matsubara, Wataru; Kusano, Kazuhiko; Bannai, Hideo et al.
Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings. 2009. p. 578-587 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5457).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A series of run-rich strings

AU - Matsubara, Wataru

AU - Kusano, Kazuhiko

AU - Bannai, Hideo

AU - Shinohara, Ayumi

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=67649999056&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67649999056&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-00982-2_49

DO - 10.1007/978-3-642-00982-2_49

M3 - Conference contribution

AN - SCOPUS:67649999056

SN - 9783642009815

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 578

EP - 587

BT - Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings

T2 - 3rd International Conference on Language and Automata Theory and Applications, LATA 2009

Y2 - 2 April 2009 through 8 April 2009

ER -

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

A series of run-rich strings

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this