Removing bidirectionality from nondeterministic finite automata
C Kapoutsis - … Symposium on Mathematical Foundations of Computer …, 2005 - Springer
International Symposium on Mathematical Foundations of Computer Science, 2005•Springer
LNCS 3618 - Removing Bidirectionality from Nondeterministic Finite Automata Page 1 Removing
Bidirectionality from Nondeterministic Finite Automata Christos Kapoutsis Computer Science
and Artificial Intelligence Laboratory, Massachusetts Institute of Technology cak@mit.edu
Abstract. We prove that every two-way nondeterministic finite automaton with n states has an
equivalent one-way nondeterministic finite automaton with at most ( 2n n+1 ) states. We also
show this bound is exact. 1 Introduction Converting an arbitrary one-way nondeterministic …
Bidirectionality from Nondeterministic Finite Automata Christos Kapoutsis Computer Science
and Artificial Intelligence Laboratory, Massachusetts Institute of Technology cak@mit.edu
Abstract. We prove that every two-way nondeterministic finite automaton with n states has an
equivalent one-way nondeterministic finite automaton with at most ( 2n n+1 ) states. We also
show this bound is exact. 1 Introduction Converting an arbitrary one-way nondeterministic …
Abstract
We prove that every two-way nondeterministic finite automaton with n states has an equivalent one-way nondeterministic finite automaton with at most () states. We also show this bound is exact.
Springer