The probabilistic communication complexity of set intersection
SIAM Journal on Discrete Mathematics
On the distributional complexity of disjointness
Theoretical Computer Science
Exact lower time bounds for computing Boolean functions on CREW PRAMs
Journal of Computer and System Sciences
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
On the power of Las Vegas II: two-way finite automata
Theoretical Computer Science
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
On the size of randomized OBDDs and read-once branching programs for k-stable functions
Computational Complexity
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Tally Languages Accepted by Monte Carlo Pushdown Automata
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
On the Power of Randomized Pushdown Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Properties of Probabilistic Pushdown Automata
Properties of Probabilistic Pushdown Automata
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
Journal of Computer and System Sciences
Pushdown automata and multicounter machines, a comparison of computation modes
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Models of pushdown automata with reset
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Computation with multiple CTCs of fixed length and width
Natural Computing: an international journal
| Hi-index | 0.00 |
We study the most important probabilistic computation modes for pushdown automata. First we show that deterministic pushdown automata (pda) are weaker than Las Vegas pda, which in turn are weaker than one-sided-error pda. Next one-sided-error pda are shown to be weaker than (nondeterministic) pda. Finally bounded-error two-sided error pda and nondeterministic pda are incomparable. To show the limited power of bounded-error two-sided pda we apply communication arguments; in particular we introduce a non-standard model of communication which we analyze with the help of the discrepancy method. The power of randomization for pda is considerable, since we construct languages which are not deterministic context-free (resp. not context-free) but are recognizable with even arbitrarily small error by one-sided-error (resp. bounded-error) pda. On the other hand we show that, in contrast to many other fundamental models of computing, error probabilities can in general not be decreased arbitrarily: we construct languages which are recognizable by one-sided-error pda with error probability 12, but not by one-sided-error pushdown automata with error probability p