Skip to main content
SpringerLink
Log in

A Series of Run-Rich Strings

  • Conference paper
Language and Automata Theory and Applications (LATA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5457))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proc. 40th Annual Symposium on Foundations of Computer Science (FOCS 1999), pp. 596–604 (1999)

    Google Scholar 

  2. Rytter, W.: The number of runs in a string: Improved analysis of the linear upper bound. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 184–195. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Rytter, W.: The number of runs in a string. Inf. Comput. 205(9), 1459–1469 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Puglisi, S.J., Simpson, J., Smyth, W.F.: How many runs can a string contain? Theoretical Computer Science 401(1–3), 165–171 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Crochemore, M., Ilie, L.: Maximal repetitions in strings. J. Comput. Syst. Sci. 74, 796–807 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Baturo, P., Piatkowski, M., Rytter, W.: The number of runs in Sturmian words. In: Ibarra, O., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol. 5148, pp. 252–261. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Giraud, M.: Not so many runs in strings. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 245–252. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Crochemore, M., Ilie, L., Tinta, L.: Towards a solution to the “Runs” conjecture. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 290–302. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Franěk, F., Yang, Q.: An asymptotic lower bound for the maximal-number-of-runs function. In: Proc. Prague Stringology Conference (PSC 2006), pp. 3–8 (2006)

    Google Scholar 

  10. Franěk, F., Simpson, R., Smyth, W.: The maximum number of runs in a string. In: Proc. 14th Australasian Workshop on Combinatorial Algorithms (AWOCA 2003), pp. 26–35 (2003)

    Google Scholar 

  11. Matsubara, W., Kusano, K., Ishino, A., Bannai, H., Shinohara, A.: New lower bounds for the maximum number of runs in a string. In: Proc. The Prague Stringology Conference 2008, pp. 140–145 (2008)

    Google Scholar 

  12. Crochemore, M., Ilie, L., Smyth, W.F.: A simple algorithm for computing the lempel ziv factorization. In: Proc. DCC 2008, pp. 482–488 (2008)

    Google Scholar 

  13. Graham, R., Knuth, D., Patashnik, O.: Concrete mathematics, 2nd edn. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science, Tohoku University, Aramaki aza Aoba 6-6-05, Aoba-ku, Sendai, 980-8579, Japan

    Wataru Matsubara, Kazuhiko Kusano & Ayumi Shinohara

  2. Department of Informatics, Kyushu University, 744 Motooka, Nishiku, Fukuoka, 819-0395, Japan

    Hideo Bannai

Authors
  1. Wataru Matsubara
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kazuhiko Kusano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hideo Bannai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ayumi Shinohara
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Av. Catalunya, 35, 43002, Tarragona, Spain

    Adrian Horia Dediu

  2. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, Spain

    Armand Mihai Ionescu

  3. European Research Council Executive Agency, 16 Place Rogier, 1210, Brussels, Belgium

    Carlos Martín-Vide

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matsubara, W., Kusano, K., Bannai, H., Shinohara, A. (2009). A Series of Run-Rich Strings. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2009. Lecture Notes in Computer Science, vol 5457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00982-2_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00982-2_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00981-5

  • Online ISBN: 978-3-642-00982-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation