On the power of finite automata with both nondeterministic and probabilistic states

SIAM Journal on Computing

Volumn 27, Issue 3, 1998, Pages 739-762

  Condon, Anne ^a   Hellerstein, Lisa ^b   Pottle, Samuel ^a   Wigderson, Avi ^c  

^a University of Wisconsin Madison   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Arthur merlin games; Hankel matrices; Interactive proof systems; Matrix tiling; Nondeterministic probabilistic finite automata

Indexed keywords

EID: 0038246725     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794265578     Document Type: Article

References (31)

1. A. V. AHO, J. D. ULLMAN, AND M. YANNAKAKIS, On notions of information transfer in VLSI circuits, in Proc. 15th Annual ACM Symposium on Theory of Computing, ACM, New York, 1983, pp. 133-139.
2. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and hardness of approximation problems, in Proc. 33rd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 14-23.
3. L. BABAI AND S. MORAN, Arthur-Merlin games: A randomized proof system and a hierarchy of complexity classes, J. Comput. System Sci., 36 (1988), pp. 254-276.
4. A. CONDON, Computational Models of Games, MIT Press, Cambridge, MA, 1989.
5. A. CONDON, L. HELLERSTEIN, S. POTTLE, AND A. WIGDERSON, On the power of finite automata with both nondeterministic and probabilistic states, in Proc. 26th Annual ACM Symposium on Theory of Computing, ACM, New York, 1994, pp. 676-685.
6. A. CONDON AND R. LADNER, Probabilistic game automata, J. Comput. System Sci., 36 (1988), pp. 452-489.
7. C. DWORK AND L. STOCKMEYER, A time-complexity gap for two-way probabilistic finite state automata, SIAM J. Comput., 19 (1990), pp. 1011-1023.
8. C. DWORK AND L. STOCKMEYER, Finite state verifiers I; The power of interaction, J. Assoc. Comput. Mach., 39 (1992), pp. 800-828.
9. L. FORTNOW AND C. LUND, Interactive proof systems and alternating time-space complexity, in Theoret. Comput. Sci., 113 (1993), pp. 55-73.
10. R. FREIVALDS, Probabilistic two-way machines, in Proc. International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Comput. Sci. 188, SpringerVerlag, New York, 1981, pp. 33-45.
11. G. FROBENIUS, Über das Trägheitsgesetz der quadratischen Formen, Sitzungsber. der Königl. Preuss. Akad. der Wiss., 1894, pp. 407-431.
12. A. G. GREENBERG AND A. WEISS, A lower bound for probabilistic algorithms for finite state machines, J. Comput. System Sci., 33 (1986), pp. 88-105.
13. B. HALSTENBERG AND R. REISCHUK, On different modes of communication, in Proc. 20th Annual ACM Symposium on the Theory of Computing, ACM, New York, 1988, pp. 162-172.
14. J. E. HOPCROFT AND J. D. ULLMAN, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
15. I. S. IOHVIDOV, Hankel and Toeplitz Matrices and Forms: Algebraic Theory, I. Gohberg, ed., G. Philip, and A. Thijsse, translators, Birkhäuser, Boston, 1982.
16. J. KANEPS AND R. FREIVALDS, Minimal nontrivial space complexity of probabilistic one-way Taring machines, in Proc. Conference on Mathematical Foundations of Computer Science, Lecture Notes in Comput. Sci. 452, Springer-Verlag, New York, 1990, pp. 355-361.
17. J. KANEPS AND R. FREIVALDS, Running time to recognize nonregular languages by 2-way probabilistic automata, in Proc. 18th International Colloquium on Automata, Languages, and Programming, Springer-Verlag, New York, 1991, pp. 174-185.
18. J. KANEPS, Regularity of one-letter languages acceptable by 2-way finite probabilistic automata, in Proc. Fundamentals of Computation Theory, Lecture Notes in Comput. Sci. 529, Springer-Verlag, New York, 1991, pp. 287-296.
19. R. M. KARP, Some bounds on the storage requirements of sequential machines and Turing machines, J. Assoc. Comput. Mach., 14 (1967), pp. 478-489.
20. F. T. LEIGHTON AND R. L. RIVEST, The Markov Chain Tree Theorem, Tech. Report MIT/LCS/TM-249, Laboratory for Computer Science, MIT, Cambridge, MA, 1983; also in IEEE Trans. Inform. Theory, IT-37 (1986), pp. 733-742.
21. F. T. LEIGHTON AND R. L. RIVEST, The Markov Chain Tree Theorem, Tech. Report MIT/LCS/TM-249, Laboratory for Computer Science, MIT, Cambridge, MA, 1983; also in IEEE Trans. Inform. Theory, IT-37 (1986), pp. 733-742.
22. K. MELHORN AND E. M. SCHMIDT, Las Vegas is better than determinism in VLSI and distributed computing, in Proc. 14th Annual ACM Symposium on Theory of Computing, ACM, New York, 1982, pp. 330-337.
23. J. ORLIN, Contentment in graph theory: Covering graphs with cliques, in Proc. Koniklijke Nederlandse Akademie van Wetenschappen, Amsterdam Series A, 80 (1977), pp. 406-424.
24. C. PAPADIMITRIOU, Games against nature, J. Comput. System Sci., 31 (1985), pp. 288-301.
25. M. O. RABIN, Probabilistic automata, Inform. Control, 6 (1963), pp. 230-245.
26. M. O. RABIN AND D. SCOTT, Finite automata and their decision problems, IBM J. Research, 3 (1959), pp. 115-125.
27. A. SALOMAA AND M. SOITTOLA, Automata-Theoretic Aspects of Formal Power Series, Texts and Monographs in Computer Science, Springer-Verlag, New York, 1978.
28. E. M. SCHMIDT, Succinctness of Description of Context Free, Regular and Unambiguous Languages, Ph.D. thesis, Cornell University, Ithaca, NY, 1978.
29. J. SHALLIT, Automaticity: I. Properties of a measure of descriptional complexity, J. Comput. System Sci., 53 (1996), pp. 10-25.
30. A. C. YAO, Some complexity questions related to distributed computing, in Proc. 11th Annual ACM Symposium on Theory of Computing, ACM, New York, 1979, pp. 209-213.
31. A. C. YAO, Lower bounds by probabilistic arguments, in Proc. 24th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1983, pp. 420-428.