Skip to main content
SpringerLink
Log in

Complexity of probabilistic versus deterministic automata

  • Miscellaneous
  • Conference paper
  • First Online:
Baltic Computer Science (BCS 1991)

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

Included in the following conference series:

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. J.M. Barzdin. Complexity of recognition of palindromes by Turing machines. Problemy kibernetiki, 15: 245–248, 1965 (Russian).

    Google Scholar 

  2. A.A.Bukhshtab. Number theory. Uchpedgiz, 1960(Russian)

    Google Scholar 

  3. P.L. Čebišev. On prime numbers. In: Opera omnia, 1: 191–207, Gosgiz (Moscow), 1944.

    Google Scholar 

  4. R. Freivalds. Fast computation by probabilistic Turing machines. Theorija algoritmov i programm. 2: 201–205, 1975 (Russian).

    Google Scholar 

  5. R.Freivalds. Probabilistic machines can use less running time. Information Processing'77 (Proc. IFIP Congress'77), 839–842, 1977.

    Google Scholar 

  6. R.Freivalds. Speeding of recognition of languages by usage of random number generators. Problemy kibernetiki, 36: 209–224 (Russian).

    Google Scholar 

  7. [Fre 791] R. Freivalds. Recognition of languages by finite probabilistic multitape and multihead automata. — Problemy peredachi informacii, 15: 99–106, 1979 (Russian).

    Google Scholar 

  8. R.Freivalds. On increase of the number of the number of states in determinization of finite probabilistic automata. — Avtomatika i vychislitelnaja technika, No.3, 39–42, 1982 (Russian).

    Google Scholar 

  9. R.Freivalds. Methods and languages to prove the power of probabilistic machines. Information Processing'83 (Proc. IFIP Congress'83), 157–162, 1983.

    Google Scholar 

  10. [Fre 831] R. Freivalds. Space and reversal complexity of probabilistic one-way Turing machines. Lecture Notes in Computer Science, 158: 159–169, 1983.

    Google Scholar 

  11. N.Z.Gabbasov and T.A.Murtazina. Improvement for the bound in the reduction theorem by Rabin. Algorithms and automata, Kazan University Press, 7–10, 1978 (Russian).

    Google Scholar 

  12. J.T.Gill III. Computational complexity of probabilistic Turing machines. Proc. 6th ACM Symposium on Theory of Computation, 91–95, 1974.

    Google Scholar 

  13. F.Hennie. Introduction to Computability. Addison Wesley, 1977.

    Google Scholar 

  14. J. Kaneps and R. Freivalds. Minimal nontrivial space complexity of probabilistic one-way Turing machines. Lecture Notes in Computer Science. 452: 355–361, 1990.

    Google Scholar 

  15. V.B. Kudrjavcev, S.V. Aleshin, A.S. Podkolzin. Introduction into Theory of Automata. Nauka, Moscow, 1985 (Russian).

    Google Scholar 

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

    Google Scholar 

  17. A.Lorencs. The problems of structural analysis of probabilistic automata and transformers of probabilistic distributions. — In: Probabilistic automata and applications. Kazan University Press, 16–22, 1986 (Russian).

    Google Scholar 

  18. O.B. Lupanov. On synthesis of some classes of control systems. Problemy kibernetiki, 10: 88–96, 1963 (Russian).

    Google Scholar 

  19. A. Paz. Some aspects of probabilistic automata. Information and Control, 9: 26–60, 1966.

    Article  Google Scholar 

  20. M.O.Rabin. Two-way finite automata. Summaries of Talks Presented at the Summer Institute of Symbolic Logic (Cornell Univ., 1957), 2nd ed. Comm. Res. Div., Inst. Defense Anal., Princeton, N.J., 366–369, 1960.

    Google Scholar 

  21. M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 6: 230–245, 1963.

    Google Scholar 

  22. M.O. Rabin. Probabilistic automata. Information and Control, 6: 230–244, 1963.

    Article  Google Scholar 

  23. J.C. Shepherdson. The reduction of two-way automata to one-way automata. IBM Journal of Research and Development, 3:198–200, 1959.

    Google Scholar 

  24. R.E.Stearns, J.Hartmanis and P.M.Lewis II. Hierarchies of memory limited computation. In: Proc. IEEE Symp. on Switching Circuit Theory and Logical Design, 179–190, 1965.

    Google Scholar 

  25. B.A.Trakhtenbrot and J.M.Barzdin. Finite Automata (Behaviour and Synthesis). North-Holland, 1972.

    Google Scholar 

  26. B.A. Trakhtenbrot. Notes on complexity of computation by probabilistic machines. In: Research in Mathematical Logic and Theory of Algorithms, Comp. Ctr. Acad. Sci. USSR, Moscow, 1974 (Russian).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, The University of Latvia, Raina bulvāris 29, Riga, Latvia

    RūsiņŠ Freivalds

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

    You can also search for this author in PubMed Google Scholar

Editor information

Janis Bārzdinš Dines Bjørner

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Freivalds, R. (1991). Complexity of probabilistic versus deterministic automata. In: Bārzdinš, J., Bjørner, D. (eds) Baltic Computer Science. BCS 1991. Lecture Notes in Computer Science, vol 502. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019368

Download citation

  • DOI: https://doi.org/10.1007/BFb0019368

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54131-8

  • Online ISBN: 978-3-540-47427-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation