Advertisement

Regularity of one-letter languages acceptable by 2-way finite probabilistic automata

  • Jānis Kaņeps
Commanications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 529)

Abstract

R. Freivalds proved that the nonregular language {0m1m} can be recognized by 2-way probabilistic finite automata (2pfa) with arbitrarily high probability 1-ε (ε>0). We prove that such an effect is impossible for one-letter languages: every one-letter language acceptable by 2pfa with an isolated cutpoint is regular.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bu85]
    R.G. Bukharajev. Fundamentals of the Theory of Probabilistic Automata.— Moscow: Nauka, 1985 (Russian).Google Scholar
  2. [DS88]
    C. Dwork and L. Stockmeyer. Interactive proof systems with finite state verifiers.— Report RJ 6262, IBM Research Division, San Jose, CA, 1988.Google Scholar
  3. [DS89]
    C.Dwork and L.Stockmeyer. On the power of 2-way probabilistic finite state automata.— Proc. 30th FOCS, 1989, p.480–485.Google Scholar
  4. [DS90]
    C. Dwork and L. Stockmeyer. A time complexity gap for two-way probabilistic finite state automata.—SIAM Journal of Computing, 1990, v.19., No.6, p.1011–1023.Google Scholar
  5. [Fr81]
    R. Freivalds. Probabilistic two-way machines.— Lecture Notes in Computer Science, Springer, 1981, v.118, p.33–45.Google Scholar
  6. [GW86]
    A.G. Greenberg and A. Weiss. A lower bound for probabilistic algorithms for finite state machines.—Journal of Computer and System Sciences, 1986, v.33, p.88–105.Google Scholar
  7. [Ju85]
    H.Jung. On probabilistic time and space.— Lecture Notes in Computer Science, Springer, 1985, v.194.Google Scholar
  8. [Ka89]
    J. Kaņeps. Stochasticity of the languages recognizable by 2-way finite probabilistic automata.— Diskretnaya Matematika, 1989, v.1, n.4, p.63–74 (Russian).Google Scholar
  9. [KF91]
    J.Kaņeps and R.Freivalds. Running time to recognize nonregular languages by 2-way probabilistic automata.— Proc. ICALP'91, Springer, 1991.Google Scholar
  10. [Ku73]
    Yu.I. Kuklin. Two-way probabilistic automata.— Avtomatika i vychislitelnaja tekhnika.— 1973, N.5, p.35–36 (Russian).Google Scholar
  11. [KS60]
    J.G. Kemeny and J.L. Snell. Finite Markov Chains.— Van Nostrand, Canada, 1960.Google Scholar
  12. [LLS84]
    R.E. Ladner, R.J. Lipton, and L.J. Stockmeyer. Alternating pushdown and stack automata.— SIAM J.Comput., 1984, 13, No. 1, p.135–155.Google Scholar
  13. [LR83]
    F.T. Leighton and R.L. Rivest. The Markov Chain Tree Theorem.— MIT Laboratory for Computer Science TM-249, MIT, Cambridge, Mass., 1983.Google Scholar
  14. [Ra63]
    M.O. Rabin. Probabilistic automata.— Information and Control.— 1963, v.6, n.3.— p.230–245.Google Scholar
  15. [SS78]
    A. Salomaa and M. Soittola. Automata-theoretic Aspects of Formal Power Series.— Berlin: Springer, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Jānis Kaņeps
    • 1
  1. 1.Institute of Mathematics and Computer ScienceThe University of LatviaRigaLatvia

Personalised recommendations