J4 ›› 2007, Vol. 29 ›› Issue (3): 60-62.
• 论文 • 上一篇 下一篇
周时阳 祝建华
出版日期:
发布日期:
Online:
Published:
摘要：
本文指出了现有DFA最小化算法的缺陷,并给出使用这些算法对DFA限制条件以及将不满足限制条件DFA等价转换成满足限制条件的DFA一般方法;在研究状态等价的充分条件基础 上,提出了一种新的适用任何DFA的最小化算法及其算法的正确性证明。
关键词: DFA 算法 最小化
Abstract:
The paper points out the disadvantages of the algorithm for minimizing DFA,gives the restriction of using this algorithm,and the common method by whic h 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 sufficie nt 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.
Key words: determinisitic finite automation;algorithm;minimizing
周时阳 祝建华. DFA最小化算法研究[J]. J4, 2007, 29(3): 60-62.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://joces.nudt.edu.cn/CN/
http://joces.nudt.edu.cn/CN/Y2007/V29/I3/60
