Skip to main content
SpringerLink
Log in

On the Computational Complexity of Infinite Words

  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 2001 (MFCS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2136))

  • 854 Accesses

Abstract

This paper contains answers to several problems in the theory of the computational complexity of infinite words. We show that the problem whether all infinite words generated by iterating dgsm’s have logarithmic space complexity is equivalent to the open problem asking whether the unary classes of languages in P and in DLOG are equivalent. Similarly, the problem to find a concrete infinite word which cannot be generated in logarithmic space is equivalent to the problem to find a concrete language which does not belong to DSPACE(n). Finally, we separate classes of infinite words generated by double and triple D0L TAG systems.

Research supported by DAAD and Academy of Finland under a common grant No. 864524.

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. Hromkovič, J., Karhumäki, J., Two lower bounds on computational complexity of infinite words, New trends in formal languages, LNCS 1218, 366–376, 1997.

    Google Scholar 

  2. Hromkovič, J., Karhumäki, J., Lepistö, A., Comparing descriptional and computational complexity of infinite words, Results and trends in theoretical computer science, LNCS 812, 169–182, 1994.

    Google Scholar 

  3. Culik, K., II, Karhumäki, J., Iterative devices generating infinite words, Int. J. Found. Comput. Sci., Vol. 5 No. 1, 69–97, 1994.

    Article  MATH  Google Scholar 

  4. Lepistö, A., On the computational complexity of infinite words, In: Developments in Language Theory II (eds.: J. Dassow, G. Rozenberg, A. Salomaa), World-Scientific, Singapore, 350–359, 1996.

    Google Scholar 

  5. Kolmogorov, A. N., Three approaches to the quantitative definition of information, Problems Inform. Transmission 1, 662–664, 1968.

    MathSciNet  Google Scholar 

  6. Lothaire, M., Combinatorics on words, Addison-Wesley, Reading, Massachusetts, 1981.

    Google Scholar 

  7. Thue, A., Über unendliche Zeichenreihen, Norske Vid. Selsk. Skr., I Mat. Nat. KI., Kristiania 7, 1–22, 1906.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Comenius University, Bratislava, Slovakia

    Pavol Ďuriš

  2. TUCS and Dep. of Math., Univ. of Turku, Datacity, Lemminkäisenkatu 14A, Turku, Finland

    Ján Maňuch

Authors
  1. Pavol Ďuriš
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ján Maňuch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematical Institute, AS CR, Žitná 25, 115 67, Praha 1, Czech Republic

    Jiří Sgall

  2. Faculty of Mathematics and Physics Institute for Theoretical Computer Science (ITI), Charles University, Malostranské náměstí 25, 118 00, Praha 1, Czech Republic

    Aleš Pultr  & Petr Kolman  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ďuriš, P., Maňuch, J. (2001). On the Computational Complexity of Infinite Words. In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-44683-4_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42496-3

  • Online ISBN: 978-3-540-44683-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation