| 一种将NFA到最小化DFA的方法 |
| |
| 引用本文： | 毛红梅,聂承启. 一种将NFA到最小化DFA的方法[J]. 计算机与现代化, 2004, 0(10): 6-7,22 |
| |
| 作者姓名： | 毛红梅 聂承启 |
| |
| 作者单位： | 南昌航空工业学院计算机系,江西,南昌,330034;江西师范大学计算中心,江西,南昌,330027 |
| |
| 摘 要： | 词法分析是编译程序重要阶段，有效的词法分析可提高编译程序的效率。本文提出用子集方法完成NFA到DFA并使用树型分割法实现DFA到最小化DFA的化简。
|
| 关 键 词： | DFA(确定有穷自动机) NFA(不确定有穷自动机) 最大集 |
| 文章编号： | 1006-2475(2004)10-0006-02 |
A Method of Alteration from NFA to Minimum-state DFA |
| |
| MAO Hong-mei,NIE Cheng-qi. A Method of Alteration from NFA to Minimum-state DFA[J]. Computer and Modernization, 2004, 0(10): 6-7,22 |
| |
| Authors: | MAO Hong-mei NIE Cheng-qi |
| |
| Affiliation: | MAO Hong-mei1,NIE Cheng-qi2 |
| |
| Abstract: | It is very important phase for compiler to do lexical analysis Effective lexical analysis can improve the efficiency of compiler.This paper puts forward a method of finishing the alteration from NFA to DFA with subset,and implementing the alteration from DFA to minimum-state DFA with tree-splitting. |
| |
| Keywords: | deterministic finite automata non-deterministic finite automata maximal set |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
