| 有限自动机的确定化算法子集法问题探析 |
| |
| 引用本文： | 王婷婷,赵光亮,贾毅峰.有限自动机的确定化算法子集法问题探析[J].六盘水师范高等专科学校学报,2013(3):11-14. |
| |
| 作者姓名： | 王婷婷 赵光亮 贾毅峰 |
| |
| 作者单位： | 1. 铜仁学院数学与计算机科学系,贵州铜仁,554300
2. 铜仁学院现代教育技术中心,贵州铜仁,554300 |
| |
| 基金项目： | 贵州省教育厅自然科学研究项目(No.:黔教科2007097)。 |
| |
| 摘 要： | 子集法是目前普遍采用的确定4LNFA为DFA的方法，但在子集法存在两处疑难：一是NFAM的状态子集I的a弧转换集合Ia的定义与解释；二是确定化过程中先对NFA做改造的必要性以及条件。
|
| 关 键 词： | 子集法 NFA DFA NFA的确定化 L 改造的必要性 条件 |
The Probe on the Subset Method Problems of Finite Automata Deterministic Algorithm |
| |
| WANG Ting-ting
,
ZHAO Guang-liang
,
JIA Yi-feng.The Probe on the Subset Method Problems of Finite Automata Deterministic Algorithm[J].Journal of Liupanshui Teachers College,2013(3):11-14. |
| |
| Authors: | WANG Ting-ting ZHAO Guang-liang JIA Yi-feng |
| |
| Institution: | WANG Ting-ting ; ZHAO Guang-liang ; JIA Yi-feng ( 1 Department of Math ＆ Computer Science, Tongren University, Tongren 554300, China; 2 Center for Educational Technology, Tongren University, Tongren 554300, China ) |
| |
| Abstract: | The subset method is a popularly adopted method for the transition from non-deterministic finite au- tomata to deterministic finite automata, howeuer it faces two problems. One is the definition and explanation of a-arc transformation set Ia of NFA＇ s state subset I. The other is the necessity and conditions of reforming NFA in the process of its determination. |
| |
| Keywords: | the subset method Nondeterministic Finite Automata Deterministic Finite Automata NFA’S de-termination Ia the necessity and conditions of reforming |
| 本文献已被 维普 万方数据 等数据库收录！ |
