Advertisement

Complexity gaps of Turing machines on infinite words

  • Daina Taimina
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Bukharaev R.G., Foundations of the theory of probabilistic automata, Moscow, "Nauka",1985.(in Russian).Google Scholar
  3. 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. 4.
    Freivalds R., Probabilistic two-way machines. — Lecture Notes in Computer Science,Springer,v.118,1981,p.33–45.Google Scholar
  5. 5.
    Landweber L.H., Decision problem for-automata. — Mathematical Systems Theory,v.3,1969,p.376–384.Google Scholar
  6. 6.
    Pecuchet J.P., Automates boustrophedons et mots infinis. — Theoretical Computer Science,1985.Google Scholar
  7. 7.
    Perrin D., Recent results on automata and infinite words. — Lecture Notes in Computer Science,Springer,v.176,1984,p.134–148.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Daina Taimina
    • 1
  1. 1.Department of MathematicsLatvian State UniversityRigaUSSR

Personalised recommendations