Advertisement

Weak and strong recognition by 2-way randomized automata

  • Andris Ambainis
  • Rūsiņš Freivalds
  • Marek Karpinski
Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1269)

Abstract

Languages weakly recognized by a Monte Carlo 2-way finite automaton with n states are proved to be strongly recognized by a Monte Carlo 2-way finite automaton with no(n) states. This improves dramatically over the previously known result by M.Karpinski and R.Verbeek [10] which is also nontrivial since these languages can be nonregular [5]. For tally languages the increase in the number of states is proved to be only polynomial, and these languages are regular.

Keywords

Markov Chain Finite Automaton Minimal Cycle Input Word Deterministic Finite Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A.Ambainis, The complexity of probabilistic versus deterministic finite automata. Lecture Notes in Computer Science, 1178(1996).Google Scholar
  2. 2.
    C. Dwork, L. Stockmeyer, Finite state verifiers I: The power of interaction. Journal of ACM, 39, 4 (1992), 800–828.Google Scholar
  3. 3.
    R. Freivalds, Probabilistic machines can use less running time. Information Processing'77, IFIP, North-Holland, 1977, 839–842.Google Scholar
  4. 4.
    R. Freivalds, Fast probabilistic algorithms. Lecture Notes in Computer Science, 74 (1979), 57–69.Google Scholar
  5. 5.
    R. Freivalds, Probabilistic two-way machines. Lecture Notes in Computer Science, 118(1981), 33–45.Google Scholar
  6. 6.
    R. Freivalds, Projections of languages recognizable by probabilistic and alternating finite multitape automata. Information Processing Letters, 13(1981), 195–198.Google Scholar
  7. 7.
    R. Freivalds, M. Karpinski, Lower space bounds for randomized computation. Lecture Notes in Computer Science, 820 (1994), 580–592.Google Scholar
  8. 8.
    A.G. Greenberg, A. Weiss, A lower bound for probabilistic algorithms for finite state machines. Journal of Computer and System Sciences, 33 (1986), 88–105.Google Scholar
  9. 9.
    J. Kaņeps, Regularity of one-letter languages acceptable by 2-way finite probabilistic automata. Lecture Notes in Computer Science, 529 (1991), 287–296.Google Scholar
  10. 10.
    M. Karpinski, R. Verbeek, On the Monte Carlo Space Constructible Functions and Separation Results for Probabilistic Complexity Classes. Information and Computation, 75(1987), 178–189.Google Scholar
  11. 11.
    J.G.Kemeny, J.L.Snell, Finite Markov Chains. Van Nostrand, 1960.Google Scholar
  12. 12.
    J.G. Kemeny, J.L. Snell, and A.W. Knapp, Denumerable Markov Chains. Springer-Verlag, Berlin et al., 1976, 416 pages.Google Scholar
  13. 13.
    K.N. King, Alternating multihead finite automata. Lecture Notes in Computer Science, 115 (1981), 506–520.Google Scholar
  14. 14.
    H.R.Lewis, and Ch.H.Papadimitriou, Elements of the Theory of Computation. Prentice-Hall, 1981, 466 pages.Google Scholar
  15. 15.
    M.O.Rabin, Two-way finite automata. Proc.Summer Institute of Symbolic Logic, Cornell, 1957, 366–369.Google Scholar
  16. 16.
    J.C. Shepherdson, The reduction of two-way automata to one-way automata. IBM Journal of Research and Development, 3(1959), 198–200.Google Scholar
  17. 17.
    A. Szepietowski, Turing Machines with Sublogarithmic Space. Lecture Notes in Computer Science, 843 (1994), 115+1 pages.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Andris Ambainis
    • 1
  • Rūsiņš Freivalds
    • 1
  • Marek Karpinski
    • 2
  1. 1.Institute of Mathematics and Computer ScienceUniversity of LatviaRigaLatvia
  2. 2.Department of Computer ScienceUniversity of BonnBonnGermany

Personalised recommendations