Minimizing a Class of Non-Deterministic Finite Automata

被引：0

作者：

Zhang, Li ^{[1
]}

机构：

[1] Guizhou Univ, Coll Comp Sci & Informat, Guiyang 550025, Peoples R China

来源：

ASIA-PACIFIC YOUTH CONFERENCE ON COMMUNICATION TECHNOLOGY 2010 (APYCCT 2010) | 2010年

关键词：

deterministic finite automata(DFA); non-deterministic finite automata(NFA); equivalence relation; minimizing;

D O I：

暂无

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

Given a deterministic finite automata(DFA), we construct the corresponding closure automata with closure operation on the language accepted by DFA. This automata is non-deterministic finite automata(NFA). We minimize this NFA by state equivalence relation of DFA, so that condition numbers is less on the premise of accepted language does not change.

引用

页码：471 / 474

页数：4