Skip to main content
SpringerLink
Log in

Complexity gaps of Turing machines on infinite words

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1987)

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

Included in the following conference series:

  • 130 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blum M., A machine-independent theory of the complexity of recursive functions. — Journal of the Association for Computing Machinery,v.14,1967,p.322–337.

    Google Scholar 

  2. Bukharaev R.G., Foundations of the theory of probabilistic automata, Moscow, "Nauka",1985.(in Russian).

    Google Scholar 

  3. Freivalds R., Space and reversal complexity of probabilistic one-way Turing machines. — Annals of Discrete Mathematics,v.24, 1985,p.39 50.

    Google Scholar 

  4. Freivalds R., Probabilistic two-way machines. — Lecture Notes in Computer Science,Springer,v.118,1981,p.33–45.

    Google Scholar 

  5. Landweber L.H., Decision problem for-automata. — Mathematical Systems Theory,v.3,1969,p.376–384.

    Google Scholar 

  6. Pecuchet J.P., Automates boustrophedons et mots infinis. — Theoretical Computer Science,1985.

    Google Scholar 

  7. Perrin D., Recent results on automata and infinite words. — Lecture Notes in Computer Science,Springer,v.176,1984,p.134–148.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Latvian State University, Riga, USSR

    Daina Taimina

Authors
  1. Daina Taimina
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach Rais Gatič Bukharajev Oleg Borisovič Lupanov

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Taimina, D. (1987). Complexity gaps of Turing machines on infinite words. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_97

Download citation

  • DOI: https://doi.org/10.1007/3-540-18740-5_97

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18740-0

  • Online ISBN: 978-3-540-48138-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation