Extended Nondeterministic Finite Automata

被引：4
|
作者：
Melnikov, Boris [1 ]
机构：
[1] Togliatti State Univ, Fac Math & Informat, Tolyatti 445667, Russia
来源：
FUNDAMENTA INFORMATICAE | 2010年 / 104卷 / 03期
关键词：
Nondeterministic finite automata; extended automata; basic automaton; algorithms of simplification;
D O I：
10.3233/FI-2010-348
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We consider a new expansion of nondeterministic finite automata. The goals of this consideration are: to apply some algorithms of such expansion for various problems of minimization of classical nondeterministic automata; to use such automata for describing practical anytime algorithms for the same problems of minimization; using such automata, we often can simplify some proofs for algorithms of simplification of usual nondeterministic automata.
引用
收藏
页码：255 / 265
页数：11
相关论文
共 50 条
12345