Skip to main content
SpringerLink
Log in

Probabilistic two-way machines

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1981 (MFCS 1981)

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

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. Adleman L.M. On distinguishing prime numbers from composite numbers. — Proc. 21st Symp. on Foundations of Computer Science, IEEE, 1980, 387–406.

    Google Scholar 

  2. Barzdin J.M. Complexity of recognition of palindromes by Turing machines. — Problemy kibernetiki, v.15, Moscow, Nauka, 1965, 245–248 (Russian).

    Google Scholar 

  3. Chandra A.K. and Stockmeyer L.J. Alternation. — Proc. 17th Symp. on Foundations of Computer Science, IEEE, 1976, 98–108.

    Google Scholar 

  4. Freivalds R. Fast computation by probabilistic Turing machines. — Učenye Zapiski Latviiiskogo Gosudarstvennogo Universiteta, v.233, 1975, 201–205. (Russian).

    Google Scholar 

  5. Freivalds R. Probabilistic machines can use less running time. Information Processing '77, IFIP, North-Holland, 1977, 839–842.

    Google Scholar 

  6. Freivalds R. Recognition of languages with high probability on different classes of automata. — Doklady Akad. Nauk SSSR, v.239, No.1, 1978, 60–62 (Russian) = Soviet Math. Doklady, v.19, No.2, 1978, 295–298.

    Google Scholar 

  7. Freivalds R. Recognition of languages by finite multihead probabilistic and deterministic automata. — Avtomatika i vyčislitelnaja tekhnika, 1979, No.3, 15–20 (Russian).

    Google Scholar 

  8. Freivalds R. Fast probabilistic algorithms. — Lecture Notes in Computer Science, v.74, 1979, 57–69.

    Google Scholar 

  9. Freivalds R. Recognition of languages by probabilistic Turing machines in real time and by pushdown automata. — Problemy peredači informacii, v.15, No.4, 1979, 96–101 (Russian).

    Google Scholar 

  10. Gardner M. Mathematical games. — Scientific American, 1978, No.2, 5–9.

    Google Scholar 

  11. Gill J.T. Computational complexity of probabilistic Turing machines. — Proc. 6th ACM Symp. on Theory of Computing, 1974, 91–95.

    Google Scholar 

  12. Janiga L. Real-time computations of two-way multihead finite automata. — Proc. Fundamentals of Computation Theory FCT'79, Berlin, Akademie, 1979, 214–218.

    Google Scholar 

  13. Jung H. Relationships between probabilistic and deterministic tape complexity. — MFCS'81, 1981.

    Google Scholar 

  14. Kovalenko I.N. A note on complexity of probabilistic and deterministic finite automata. — Kibernetika, 1965, No.2, 35–36 (Russian).

    Google Scholar 

  15. Kozen D. On parallelism in Turing machines. — Proc. 17th Symp. on Foundations of Computer Science, IEEE, 1976, 89–97.

    Google Scholar 

  16. Kuklin Yu.I. Two-way probabilistic automata. — Avtomatika i vyčislitelnaja tekhnika, 1973, No.5, 35–36 (Russian).

    Google Scholar 

  17. Ladner R.E., Lipton R.J., Stockmeyer L.J. Alternating pushdown automata. — Proc. 19th Symp. on Foundations of Computer Science, IEEE, 1978, 92–106.

    Google Scholar 

  18. de Leeuw K., Moore E.F., Shannon C.E., Shapiro N. Computability by probabilistic machines. — Automata Studies, Ann. of Math.Studies, v.34, Princeton Univ.Press, 1956, 183–212.

    Google Scholar 

  19. Lewis II P.M., Stearns R.E., Hartmanis J. Memory bounds for recognition of context-free and context-sensitive languages. — IEEE Conf.Rec.Switch.Circuit Theory and Logic. Design, N.Y., 1965, 191–202.

    Google Scholar 

  20. Monien B., and Sudborough I.H. On elimination of nondeterminism in tape-bounded computations. — Lecture Notes in Computer Science, v.71, 1979.

    Google Scholar 

  21. Rabin M.O. Probabilistic algorithms. — Algorithms and Complexity. New Directions and Recent Results, Academic Press, 1976, 21–40.

    Google Scholar 

  22. Rabin M.O. Probabilistic automata. — Information and Control, v.6, No.3, 1963, 230–245.

    Google Scholar 

  23. Rabin M.O. Two-way finite automata. — Proc. Summer Institute of Symbolic Logic, Cornell, 1957, 366–369.

    Google Scholar 

  24. Shepherdson J.C. The reduction of two-way automata to one-way automata. — IBM Journal of Research and Development, v.3, No.2, 1959, 198–200.

    Google Scholar 

  25. Simon J. On tape-bounded probabilistic computations. — Relatorio Interno No.75, Universidade Enstadul de Campinas, Brazil, 1977.

    Google Scholar 

  26. Solovay R., Strassen V. Fast Monte-Carlo test for primality. — SIAM Journal on Computing, v.6, No.1, 1977, 84–85.

    Google Scholar 

  27. Stearns R.E., Hartmanis J., Lewis P.M. II. Hierarchies of memory limited computations. — IEEE Conf.Rec.Switch. Circuit Theory and Logic. Design, N.Y., 1965, 197–190.

    Google Scholar 

  28. Trakhtenbrot B.A. Notes on complexity of computation by probabilistic machines. — Research in Mathematical Logic and Theory of Algorithms, Moscow, Comp.Ctr. Acad.Sci.USSR, 1974 (Russian) = Algebraische Modelle, Kategorien und Gruppoide. Studien zur Algebra und Ihre Anwendungen, 7, Berlin, Akademie, 1979, 165–178 (German).

    Google Scholar 

  29. Vitányi P.M.B. On the power of real-time Turing machines under varying specifications. — Lecture Notes in Computer Science, v.85, 1980, 658–671.

    Google Scholar 

  30. Yablonskii S.V. On algorithmic difficulties in the synthesis of minimal switching circuits. — Problemy kibernetiki, v.2, Moscow, Fizmatgiz, 1959, 75–121 (Russian).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Center, Latvian State University, Riga, USSR

    Rūsiņš Freivalds

Authors
  1. Rūsiņš Freivalds
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Michal Chytil

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Freivalds, R. (1981). Probabilistic two-way machines. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_72

Download citation

  • DOI: https://doi.org/10.1007/3-540-10856-4_72

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10856-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation