The complexity of Boolean functions
The complexity of Boolean functions
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
Proceedings of the 7th Colloquium on Automata, Languages and Programming
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Lower bounds on the size of sweeping automata
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
On notions of information transfer in VLSI circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On the size of randomized OBDDs and read-once branching programs for k-stable functions
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the Power of Randomized Pushdown Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Partially-Ordered Two-Way Automata: A New Characterization of DA
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
One alternation can be more powerful than randomization in small and fast two-way finite automata
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
The investigation of the computational power of randomized computations is one of the central tasks of complexity and algorithm theory. This paper continues in the comparison of the computational power of Las Vegas computations with the computational power of deterministic and nondeterministic ones. While for one-way finite automata the power of different computational modes was successfully determined one does not have any nontrivial result relating the power of determinism, Las Vegas and nondeterminism for two-way finite automata. The three main results of this paper are the following ones. (i) If, for a regular language L, there exist small two-way nondeterministic finite automata for both L and LC, then there exists a small two-way Las Vegas finite automaton for L. (ii) There is a quadratic gap between nondeterminism and Las Vegas for two-way finite automata. (iii) For every k ∈ N, there is a regular language Sk such that Sk can be accepted by two-way Las Vegas finite automaton with O(k) states, but every two-way deterministic finite automaton recognizing Sk has at least Ω(k2= log2 k) states.