Sciweavers

Share
SAGA
2007
Springer

An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata

8 years 11 months ago
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata
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.
Christos A. Kapoutsis, Richard Královic, To
Added 09 Jun 2010
Updated 09 Jun 2010
Type Conference
Year 2007
Where SAGA
Authors Christos A. Kapoutsis, Richard Královic, Tobias Mömke
Comments (0)
books