SAGA
2007
Springer
13 years 10 months ago
2007
Springer
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 ...