六盘水师范学院学报Issue(3)：11-14,4.DOI:10.3969/j.issn.1671-055X.2013.03.004
有限自动机的确定化算法子集法问题探析1
The Probe on the Subset Method Problems of Finite Automata Deterministic Algorithm
摘要
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.关键词
子集法/NFA/DFA/NFA的确定化/Ia/改造的必要性/条件Key words
the subset method/Nondeterministic Finite Automata/Deterministic Finite Automata/NFA’S de-termination/Ia/the necessity and conditions of reforming分类
信息技术与安全科学引用本文复制引用
王婷婷,赵光亮,贾毅峰..有限自动机的确定化算法子集法问题探析1[J].六盘水师范学院学报,2013,(3):11-14,4.基金项目
贵州省教育厅自然科学研究项目（No.:黔教科2007097）。 （）
