An exponential gap between Las Vegas and deterministic sweeping finite automata

Authors:
Christos Kapoutsis;Richard Královič;Tobias Mömke
Affiliations:
Department of Computer Science, ETH Zürich;Department of Computer Science, ETH Zürich;Department of Computer Science, ETH Zürich
Venue:
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Year:
2007

Citing 4
Cited 6

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
Nondeterminism and the size of two way finite automata

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Small sweeping 2NFAs are not closed under complement

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

On the Size Complexity of Rotating and Sweeping Automata

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Lower bounds on the size of sweeping automata

Journal of Automata, Languages and Combinatorics
A technique for proving lower bounds on the size of sweeping automata

Journal of Automata, Languages and Combinatorics
Size complexity of rotating and sweeping automata

Journal of Computer and System Sciences
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
Infinite vs. finite size-bounded randomized computations

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

A two-way finite automaton is sweeping if its input head can change direction only on the end-markers. For each n ≥ 2, we exhibit a problem that can be solved by a O(n2)-state sweeping LasVegas automaton, but needs 2Ω(n) states on every sweeping deterministic automaton.