摘要
本文指出了现有DFA最小化算法的缺陷,并给出使用这些算法对DFA限制条件以及将不满足限制条件DFA等价转换成满足限制条件的DFA一般方法;在研究状态等价的充分条件基础上,提出了一种新的适用任何DFA的最小化算法及其算法的正确性证明。
The paper points out the disadvantages of the algorithm for minimizing DFA,gives the restriction of using this algorithm,and the common method by which a DFA which does not satisfy the restriction can be transformed equivalently to a DFA which satisfies the restriction.Based on a study of the sufficient conditions of state equivalence,a brand-new algorithm of minimizing DFA that can be applied to any DFA is proposed,also the proof of the accuracy of this algorithm is provided.
出处
《计算机工程与科学》
CSCD
2007年第3期60-62,共3页
Computer Engineering & Science
关键词
DFA
算法
最小化
determinisitic finite automation
algorithm
minimizing
