Advertisement

On Some Variations of Two-Way Probabilistic Finite Automata Models

  • Bala Ravikumar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4036)

Abstract

Rabin [21] initiated the study of probabilistic finite automata (PFA). Rabin’s work showed a crucial role of the gap in the error bound (for accepting and non-accepting computations) in the power of the model. Further work resulted in the identification of qualitatively different error models (one-sided error, bounded and unbounded errors, no error etc.) Karpinski and Verbeek [16] and Nisan [20] studied a model of probabilistic automaton in which the tape containing random bits can be read by a two-way head. They presented results comparing models with one-way vs. two-way access to randomness. Dwork and Stockmeyer [5] and Condon et al. [4] studied a model of 2-PFA with nondeterministic states (2-NPFA). In this paper, we present some results about the above mentioned variations of probabilistic finite automata, as well as a model of 2-PFA augmented with a pebble studied in [22]. Our observations indicate that these models exhibit subtle variations in their computational power. We also mention many open problems about these models. Complete characterizations of their power will likely provide deeper insights about the role of randomness is space-bounded computations.

Keywords

Turing Machine Input String Input Tape Counter Machine Coin Toss 
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.
    Alt, H., Mehlhorn, K.: Lower bounds for the space complexity for context-free recognition. In: Proc. of ICALP, pp. 338–351 (1976)Google Scholar
  2. 2.
    Borodin, A., Cook, S., Pippenger, N.: Parallel computation for well-endowed rings and space-bounded probabilistic machines. Information and Control, 113–136 (1983)Google Scholar
  3. 3.
    Condon, A., Lipton, R.: On interactive proofs with space-bounded verifiers. In: Proc. of 30th IEEE Annual Symp. on Found. of Comp. Science, pp. 462–467 (1989)Google Scholar
  4. 4.
    Condon, A., et al.: On the power of finite automata with both nondeterministic and probabilistic states. SIAM Journal on Computing, 739–762 (1998)Google Scholar
  5. 5.
    Dwork, C., Stockmeyer, L.: Interactive proof systems with finite state verifiers. IBM Report RJ 6262 (1988)Google Scholar
  6. 6.
    Dwork, C., Stockmeyer, L.: On the Power of 2-way Probabilistic Finite State Automata. In: Proc. of 30th IEEE Annual Symp. on Found. of Comp. Science, pp. 480–485 (1989)Google Scholar
  7. 7.
    Dwork, C., Stockmeyer, L.: A time complexity gap for two-way probabilistic finite automata. SIAM Journal on Computing, 1011–1023 (1990)Google Scholar
  8. 8.
    Dwork, C., Stockmeyer, L.: Finite state verifiers I: The power of interaction. Journal of the ACM, 800–828 (1992)Google Scholar
  9. 9.
    Freivalds, R.: Probabilistic Two-way Machines. In: Gruska, J., Chytil, M.P. (eds.) MFCS 1981. LNCS, vol. 118, pp. 33–45. Springer, Heidelberg (1981)Google Scholar
  10. 10.
    Freivalds, R.: Why Probabilistic Algorithms Can be More Effective in Certain Cases? (invited Talk). Math. Foundations of Computer Science, pp. 1–14 (1986)Google Scholar
  11. 11.
    Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. In: Proc. of 17th Annual ACM Symp. on Theory of Computing, pp. 291–304 (1985)Google Scholar
  12. 12.
    Goldwasser, S., Sipser, M.: Private coins vs. public coins in interactive proof systems. In: Proc. of 18th ACM Symp. on Theory of Computing, pp. 59–68 (1986)Google Scholar
  13. 13.
    Greenberg, A., Weiss, A.: A Lower Bound for Probabilistic Algorithms for Finite State Machines. Jl. of Comp. and Sys. Sciences, 88–105 (1986)Google Scholar
  14. 14.
    Hopcroft, J., Ullman, J.: Introduction to Automata, Languages and Computation. Addison-Wesley, Reading (1979)Google Scholar
  15. 15.
    Ibarra, O., Ravikumar, B.: Sublogarithmic space Turing machines, nonuniform space complexity and closure properties. Mathematical Systems Theory, 1–21 (1988)Google Scholar
  16. 16.
    Karpinski, M., Verbeek, R.: There is no polynomial deterministic simulation of probabilistic space with two-way random-tape generator. Information and Computation, 158–162 (1985)Google Scholar
  17. 17.
    Karpinski, M., Verbeek, R.: On the power of Two-way Random Generators and the Impossibility of Deterministic Poly-Space Simulation. Information and Control 71, 131–142 (1986)MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Kaneps, J.: Regularity of one-letter languages acceptable by 2-way finite probabilistic automata. In: Proc. of Fundamentals of Computation Theory, pp. 287–296 (1991)Google Scholar
  19. 19.
    Minsky, M.: Recursive unsolvability of Post’s problem of tag and other topics in the theory of Turing machines. Annals of Mathemetics, 570–581 (1961)Google Scholar
  20. 20.
    Nisan, N.: On Read-Once vs. Multiple Access to Randomness in Logspace. In: Proc. of Fifth IEEE Structure in Complexity Theory, Barcelona, Spain, pp. 179–184 (1990)Google Scholar
  21. 21.
    Rabin, M.: Probabilistic finite automata. Information and Control, 230–245 (1963)Google Scholar
  22. 22.
    Ravikumar, B.: On the power of probabilistic finite automata with bounded error probability. In: Proc. of the Foundations of Sofware Technology and Theoretical Computer Science, pp. 392–403 (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Bala Ravikumar
    • 1
  1. 1.Department of Computer ScienceSonoma State UniversityRohnert ParkUSA

Personalised recommendations