Lower bounds for language recognition on two-dimensional alternating multihead machines
Journal of Computer and System Sciences
On measuring nondeterminism in regular languages
Information and Computation
On the relation between ambiguity and nondeterminism in finite automata
Information and Computation
Exact lower time bounds for computing Boolean functions on CREW PRAMs
Journal of Computer and System Sciences
Non-deterministic communication complexity with few witnesses
Journal of Computer and System Sciences
Nondeterministic communication with a limited number of advice bits
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
Lower Bounds on Information Transfer in Distributed Computations
Journal of the ACM (JACM)
Amplification of slight probabilistic advantage at absolutely no cost in space
Information Processing Letters
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Lower Bounds for Computation with Limited Nondeterminism
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
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
Some complexity questions related to distributive computing(Preliminary Report)
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 probabilistic pushdown automata
Information and Computation
| Hi-index | 0.00 |
The goal of this work is to investigate the computational power of nondeterminism and Las Vegas randomization for two-dimensional finite automata. The following three results are the main contribution of this paper: (i) Las Vegas (three-way) two-dimensional finite automata are more powerful than (three-way) two-dimensional deterministic ones. (ii) Three-way two-dimensional nondeterministic finite automata are more powerful than three-way two-dimensional Las Vegas finite automata. (iii) There is a strong hierarchy based on the number of computations (as measure of the degree of nondeterminism) for three-way two-dimensional finite automata.These results contrast with the situation for one-way and two-way finite automata, where all these computation modes have the same acceptance power, and the differences may occur only in the sizes of automata. Results (i) and (ii) provide the first such simultaneous acceptance separation between nondeterminism, Las Vegas, and determinism for a computing model.