Converting two-way nondeterministic unary automata into simpler automata
Theoretical Computer Science - Mathematical foundations of computer science
Descriptional complexity of finite automata: concepts and open problems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Deterministic moles cannot solve liveness
Journal of Automata, Languages and Combinatorics
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Two-way unary automata versus logarithmic space
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Two-way automata versus logarithmic space
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Small sweeping 2NFAs are not closed under complement
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
State complexity of kleene-star operations on trees
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Two-Way automata making choices only at the endmarkers
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
| Hi-index | 0.00 |
On every n-long input, every two-way finite automaton (2FA) can reverse its head O(n) times before halting. A 2FA with few reversals is an automaton where this number is only o(n). For every h, we exhibit a language that requires Ω(2h) states on every deterministic 2FA with few reversals, but only h states on a nondeterministic 2FA with few reversals.