and Probabilistic States Anne Condon University of...  Home/Search
Context
Related
| poly.edu/~hstein/pubs/npfa.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: poly.edu/hstein/journal (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study finite automata with both nondeterministic and random states (npfa's). We restrict our attention to those npfa's that accept their languages with a small probability of error and run in polynomial expected time. Equivalently, we study Arthur-Merlin games where Arthur is limited to polynomial time and constant space. (Update)
Active bibliography (related documents): More All
3.1: On the Power of Finite Automata with both.. - Condon, Hellerstein, al. (1994) (Correct)
0.4: Automaticity And Rationality - Shallit (2000) (Correct)
0.4: A Time Complexity Gap For 2-Way Probabilistic Finite State.. - Dwork, Stockmeyer (Correct)
Similar documents based on text: More All
0.4: On Approximation Algorithms for Hierarchical MAX-SAT - Agarwal, Condon (1997) (Correct)
0.3: Algorithms for Graph Partitioning on the Planted Partition Model - Condon, Karp (1999) (Correct)
0.2: Asynchronous Analysis of Parallel Dynamic Programming.. - Lewandowski, Condon, Bach (1994) (Correct)
BibTeX entry: (Update)
@misc{ states-power,
author = "And Probabilistic States",
title = "On the Power of Finite Automata with both Nondeterministic",
url = "citeseer.ist.psu.edu/618080.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992
166 Some complexity questions related to distributed computing (context) - Yao - 1979
104 Automata-theoretic aspects of formal power series (context) - Salomaa, Soittola - 1978
96 Finite automata and their decision problems (context) - Rabin, Scott - 1959
79 Arthur-Merlin games: A randomized proof system and a hierarc.. (context) - Babai, Moran - 1988
58 Lower bounds by probabilistic arguments (context) - Yao - 1983
58 Games against nature (context) - Papadimitriou - 1985
54 Las Vegas is better than determinism in VLSI and distributed.. (context) - Melhorn, Schmidt - 1982
35 On notions of information transfer in VLSI circuits (context) - Aho, Ullman et al. - 1983
34 Probabilistic automata (context) - Rabin - 1963
29 Automaticity: properties of a measure of descriptional compl.. (context) - Shallit - 1994
22 Finite state verifiers I: the power of interaction (context) - Dwork, Stockmeyer - 1992
20 Computational Models of Games (context) - Condon - 1989
13 A time-complexity gap for two-way probabilistic finite state.. (context) - Dwork, Stockmeyer - 1990
12 Minimal nontrivial space complexity of probabilistic oneway .. (context) - Kaneps, Freivalds - 1990
11 Some bounds on the storage requirements of sequential machin.. (context) - Karp - 1967
11 Interactive proof systems and alternating time-space complex.. - Fortnow, Lund - 1991
10 Laboratory for Computer Science (context) - Leighton, Rivest et al.
9 A lower bound for probabilistic algorithms for finite state .. (context) - Greenberg, Weiss - 1986
9 Probabilistic game automata (context) - Condon, Ladner - 1988
6 Running Time to Recognize Nonregular Languages by 2Way Proba.. (context) - Kaneps, Freivalds - 1991
6 Succinctness of description of context free (context) - Schmidt - 1978
6 Contentment in Graph Theory: Covering Graphs with Cliques (context) - Orlin - 1977
5 Regularity of one-letter languages acceptable by 2-way finit.. (context) - Kaneps - 1991
4 the International Symposium on Mathematical Foundations of C.. (context) - Freivalds, machines et al. - 1981
3 Hankel and Toeplitz Matrices and Forms: Algebraic Theory (context) - Iohvidov - 1982
2 the Twentieth Annual ACM Symposium on the Theory of Computin.. (context) - Halstenberg, Reischuk et al. - 1988
2 Uber das Tragheitsgesetz der quadratischen Formen (context) - Frobenius
2 the Twenty Sixth Annual ACM Symposium on Theory of Computing (context) - Power, automata et al. - 1994
Documents on the same site (http://cis.poly.edu/hstein/journal.html): More
On Generalized Constraints and Certificates - Hellerstein (1998) (Correct)
Conjunctions of Unate DNF Formulas: Learning and Structure - Feigelson, Hellerstein (1998) (Correct)
An Algorithm To Learn Read-Once Threshold.. - Bshouty, Hancock, .. (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC