View Related Documents

Abstract

We prove that every two-way nondeterministic finite automaton with n states has an equivalent one-way nondeterministic finite automaton with at most (2nn+1^{2n}_{n+1}) states. We also show this bound is exact.

Fulltext Preview

Image of the first page of the fulltext document