DF-SUBSET: An Improved Conversion Algorithm from NFA to DFA

摘要：

We study the mechanism and complexity of the problem that converting an NFA (Nondeterministic Finite Automata) to a DFA (Deterministic Finite Automata). We put forward a improving algorithm: DF-SUBSET based on SUBSET. The DF-SUBSET can effectively decrease the amount of computation during the conversion of an NFA to a DFA by attaching a mark on each state node and a flag on each searching path.

关键词： FA subset DF-subset

作者: Jing Maohua Shi Wenbo Cai Shuxun Yu Changyong

作者单位: Electronic Information Department,Northeastern University at Qinghuangdao,Hebei,Qinghuangdao,China Commerce and Trade Department,Northeastern University at Qinghuangdao,Hebei,Qinghuangdao,China

会议类型: 国际会议

会议名称: 2011 International Conference on Opto-Electronics Engineering and Information Science(2011光电电子工程与信息科学国际会议 ICOEIS 2011)

会议地点: 西安

会议语种:英文

页码: 1319-1322

在线出版日期: 2011-12-23（万方平台首次上网日期，不代表论文的发表时间）