On an expansion of nondeterministic finite automata |
| |
| Authors: | Boris Melnikov |
| |
| Affiliation: | 1. Department of Mathematics and Computer Science, Togliatti State University, Belorusskaya str., 14, 445667, Togliatti, Samarskaya obl., Russia
|
| |
| 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: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
