Probabilistic two-way machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 118 LNCS, Issue , 1981, Pages 33-45

  Freivalds, Rūsiņš ^a  

^a UNIVERSITY OF LATVIA   (Latvia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85035794367     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-10856-4_72     Document Type: Conference Paper

References (30)

1. Adleman L.M. On distinguishing prime numbers from composite numbers.-Proc. 21st Symp. on Foundations of Computer Science IEEE 1980 387-406.
2. Barzdin J.M. Complexity of recognition of palindromes by Turing machines.-Problemy kibernetiki v. 15 Moscow Nauka 1965 245-248 (Russian).
3. Chandra A.K. and Stockmeyer L. J. Alternation.-Proc. 17th Symp. on Foundations of Computer Science IEEE 1976 98-108.
4. Freivalds R. Fast computation by probabilistic Turing machines.-Učenye Za-piski Latviískogo Gosudarstvennogo Universiteta v.233 1975 201-205. (Russian).
5. Freivalds R. Probabilistic machines can use less running time. Information Processing '77 IFIP North-Holland 1977 839-842.
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.
7. Freivalds R. Recognition of languages by finite multihead probabilistic and deterministic automata.-Avtomatika i vyčislitelnaja tekhnika 1979 No.3 15-20 (Russian).
8. Freivalds R. Fast probabilistic algorithms.-Lecture Notes in Computer Science v.74 1979 57-69.
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).
10. Gardner M. Mathematical games.-Scientific American 1978 No.2 5-9.
11. Gill J.T. Computational complexity of probabilistic Turing machines.-Proc. 6th ACM Symp. on Theory of Computing 1974 91-95.
12. Janiga L. Real-time computations of two-way multihead finite automata.-Proc. Fundamentals of Computation Theory FCT'79 Berlin Akademie 1979 214-218.
13. Jung H. Relationships between probabilistic and deterministic tape complexity.-MFCS' 81 1981.
14. Kovalenko I.N. A note on complexity of probabilistic and deterministic finite automata.-Kibernetika 1965 No.2 35-36 (Russian).
15. Kozen D. On parallelism in Turing machines.-Proc. 17th Symp. on Foundations of Computer Science IEEE 1976 89-97.
16. Kuklin Yu.I. Two-way probabilistic automata.-Avtomatika i vyčislitelnaja tekhnika 1973 No.5 35-36 (Russian).
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.
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.
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.
20. Monien B. and Sudborough I.H. On elimination of nondeterminism in tape-bounded computations.-Lecture Notes in Computer Science v.71 1979.
21. Rabin M.O. Probabilistic algorithms.-Algorithms and Complexity. New Directions and Recent Results Academic Press 1976 21-40.
22. Rabin M.O. Probabilistic automata.-Information and Control v.6 No.3 1963 230-245.
23. Rabin M.O. Two-way finite automata.-Proc. Summer Institute of Symbolic Logic Cornell 1957 366-369.
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.
25. Simon J. On tape-bounded probabilistic computations.-Relatorio Interno No.75 Universidade Enstadul de Campinas Brazil 1977.
26. Solovay R. Strassen V. Fast Monte-Carlo test for primality.-SIAM Journal on.Computing v.6 No.1 1977 84-85.
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.
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 Grup-poide. Studien zur Algebra und Ihre Anwendungen 7 Berlin Akademie 1979 165-178 (German).
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.
30. Yablonskií S.V. On algorithmic difficulties in the synthesis of minimal switching circuits.-Problemy kibernetiki. v.2 Moscow Fizmatgiz 1959 75-121 (Russian).