本文已被：浏览 2807次 下载 5682次
Received:February 23, 2012 Revised:March 27, 2012
Received:February 23, 2012 Revised:March 27, 2012
中文摘要: NFA 的确定化具有重要的理论和实际意义. 迄今为止, 普遍采用子集构造法将一个NFA(非确定性自动机)转化为DFA(确定性自动机),但这种方法需要引入空输入ε及状态子集I 的ε-闭包, 其计算过程相对繁琐. 而且在确定化过程中对于 NFA 状态集存在ε-closure 重复计算和由于对非ε转换的判断而引起的重复计算等问题.本文描述了一种将一类NFA 直接转化为DFA 的方法. 在本方法中, 不需要引入空输入ε, 可根据原始的NFA 状态图或状态转移表直接得出等价的DFA 状态图或状态转移表, 而且所有状
Abstract:It is important in theory and practice to translate a NFA into DFA. So far, subset construction is the most popular method. The method, however, needs import a dummy input ε and ε-closure and has a complicated computing procedure. In this paper, a new method to translate a NFA into DFA straightly is described. The new method needn’t import a dummy input ε and ε-closure, it accords to the original NFA state graph or state shift table to translate a NFA into DFA straightly.
keywords: finite automata nondeterministic finite automata deterministic finite automata subset construction convert straightly
文章编号： 中图分类号： 文献标志码：
基金项目:
| Author Name | Affiliation |
| CHENG Yuan-Bin | School of Mathematics & Computer Science, Jianghan University, Wuhan 430056, China |
| Author Name | Affiliation |
| CHENG Yuan-Bin | School of Mathematics & Computer Science, Jianghan University, Wuhan 430056, China |
引用文本：
程元斌.一类NFA 到DFA 的直接转化方法.计算机系统应用,2012,21(10):109-113
CHENG Yuan-Bin.Translating a Kind of NFA Into DFA Straightly.COMPUTER SYSTEMS APPLICATIONS,2012,21(10):109-113
程元斌.一类NFA 到DFA 的直接转化方法.计算机系统应用,2012,21(10):109-113
CHENG Yuan-Bin.Translating a Kind of NFA Into DFA Straightly.COMPUTER SYSTEMS APPLICATIONS,2012,21(10):109-113
