ON AN EXPANSION OF NONDETERMINISTIC FINITE AUTOMATA

  • Melnikov, Boris (Department of Mathematics and Computer Science, Togliatti State University)
  • Published : 2007.05.31

Abstract

We consider a possible generalization of nondeterministic finite automata. The goals of this consideration are: to apply some obtained algorithms for various problems of minimization of classical nondeterministic automata; to use such automata for describing practical anytime algorithms for the same problems of minimization; to simplify some proofs for algorithms of simplification for usual nondeterministic automata.

Keywords