Greenberg, A. G. and Weiss, A. (1986). A lower bound for probabilistic algorithms for nite state machines. J. Comput. Syst. Sci., 33:88-105. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Bounded Error Probabilistic Finite State Automata - Condon (Correct)
....and Freivalds [Kaneps and Freivalds, 1990] showed that 2pfa s that run in subexponential expected time only accept the regular languages. The techniques used to prove this result include fundamental results on Markov chains that are interesting in their own right [Dwork and Stockmeyer, 1990, Greenberg and Weiss, 1986, Leighton and Rivest, 1983] We conclude this section with a brief summary of results on succinctness of 2pfa s in terms of number of states needed to recognize languages compared with deterministic or nondeterministic nite automata. Section 5. concerns undecidability results for pfa s. ....
....Rabin s result to show that only the regular languages are recognized by 2pfa s that are restricted to have expected running time that is subexponential. In particular, 2PFA polytime = Regular. We describe their techniques in this section. These build on earlier work of Greenberg and Weiss [Greenberg and Weiss, 1986], who showed that exponential time is needed to recognize fa n b n g. Let P be a 2pfa that halts in polynomial expected time; in particular P halts with probability 1, and assume again for simplicity that the accept or reject states are only entered when the head is on the right endmarker. As ....
[Article contains additional citation context not shown here]
Greenberg, A. G. and Weiss, A. (1986). A lower bound for probabilistic algorithms for nite state machines. J. Comput. Syst. Sci., 33:88-105.
A Survey of Quantum Computing and Automata - de Doncker, Cucos (Correct)
No context found.
A. G. Greenberg and A. Weiss, \A lower bound for probabilistic algorithms for nite state machines", J. Comput. Syst. Sci., Vol. 33, 88-105, 1986.
Weak and Strong Recognition by 2-way Randomized Automata - Ambainis, Freivalds.. (Correct)
No context found.
A.G.Greenberg, A.Weiss, A lower bound for probabilistic algorithms for nite state machines. Journal of Computer and System Sciences, 33 (1986), 88-105.
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