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.

• Type: Conference
• Year: 2007
• Where: SAGA
• Authors: Christos A. Kapoutsis, Richard Královic, Tobias Mömke
• Keywords: SAGA 2007, Sweeping Deterministic Automaton, Sweeping Lasvegas Automaton, Two-way finite Automaton