On the Power of Finite Automata with Both Nondeterministic and Probabilistic States
暂无分享,去创建一个
Lisa Hellerstein | Avi Wigderson | Anne Condon | Samuel Pottle | A. Wigderson | L. Hellerstein | A. Condon | S. Pottle
[1] J. Milnor. Games Against Nature , 1951 .
[2] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..
[3] Richard M. Karp,et al. Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines , 1967, JACM.
[4] J. Orlin. Contentment in graph theory: Covering graphs with cliques , 1977 .
[5] Arto Salomaa,et al. Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.
[6] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[7] Rusins Freivalds,et al. Probabilistic Two-Way Machines , 1981, MFCS.
[8] Kurt Mehlhorn,et al. Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.
[9] Alfred V. Aho,et al. On notions of information transfer in VLSI circuits , 1983, STOC.
[10] Andrew C. Yao,et al. Lower bounds by probabilistic arguments , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[11] Christos H. Papadimitriou,et al. Games against nature , 1985, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[12] W. Ledermann,et al. HANKEL AND TOEPLITZ MATRICES AND FORMS: Algebraic Theory , 1983 .
[13] Albert G. Greenberg,et al. A Lower Bound for Probabilistic Algorithms for Finite State Machines , 1984, J. Comput. Syst. Sci..
[14] Richard E. Ladner,et al. Probabilistic Game Automata , 1986, J. Comput. Syst. Sci..
[15] Rüdiger Reischuk,et al. On different modes of communication , 1988, STOC '88.
[16] László Babai,et al. Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..
[17] M. W. Shields. An Introduction to Automata Theory , 1988 .
[18] Richard E. Ladner,et al. Probabilistic Game Automata , 1988, J. Comput. Syst. Sci..
[19] Anne Condon,et al. Computational models of games , 1989, ACM distinguished dissertations.
[20] Rusins Freivalds,et al. Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines , 1990, MFCS.
[21] Cynthia Dwork,et al. A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata , 1990, SIAM J. Comput..
[22] Rusins Freivalds,et al. Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata , 1991, ICALP.
[23] Janis Kaneps. Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata , 1991, FCT.
[24] Carsten Lund,et al. Interactive Proof Systems and Alternating Time-Space Complexity , 1991, STACS.
[25] Cynthia Dwork,et al. Finite state verifiers I: the power of interaction , 1992, JACM.
[26] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[27] Jeffrey Shallit,et al. Automaticity: Properties of a Measure of Descriptional Complexity , 1994, STACS.
[28] Lisa Hellerstein,et al. On the power of finite automata with both nondeterministic and probabilistic states (preliminary version) , 1994, STOC '94.