A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition

Authors:
Pavol Duris;Juraj Hromkovic;Katsushi Inoue
Affiliations:
-;-;-
Venue:
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
Year:
2000

Citing 0
Cited 3

On the Power of Randomized Pushdown Automata

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
On the power of randomized multicounter machines

Theoretical Computer Science - Insightful theory
Pushdown automata and multicounter machines, a comparison of computation modes

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The investigation of the computational power of randomized computations is one of the central tasks of current complexity and algorithm theory. In this paper for the first time, a 驴strong驴 separation between the power of determinism, Las Vegas randomization, and nondeterminism for a computing model is proved. The computing model considered here are finite automata with two-dimensional input tapes (i.e., finite automata recognizing picture languages). Moreover, a hierarchy on the degree of nondeterminism of two-dimensional finite automata is established.