Abstract
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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Kapoutsis, C. A. (2011). Nondeterminism is essential in small 2FAs with few reversals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6756 LNCS, pp. 198–209). https://doi.org/10.1007/978-3-642-22012-8_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
