一种改进的有限自动机正则化方法研究  

Research on a Reformation of Converting FAM to Regular Expression

作　　者：孙俊[1] 孙玉强[2] 杨瑞敏[2] 胡伟强[2] 

机构地区：[1]中原工学院,郑州450007 [2]河南师范大学计算机与信息技术学院,河南新乡453007

出　　处：《中原工学院学报》2008年第3期61-64,共4页Journal of Zhongyuan University of Technology

摘　　要：有限自动机与正则表达式具有等价性,针对传统算法在处理特定有限自动机正则化中的缺陷,通过对终止状态F,加入δ(F,ξ)=F的转换函数,有效地解决了传统算法中不能利用正规表达式方程组求解的问题,并举例证明其实现过程.Converting finite automation machine and regular expression are equivalent. However, for the traditional ways having many shortcomings in converting specific finite automation machine to regular expression, the paper gives a reformation method of converting finite automation machine to regular expression by adding a converting function of δ（F,ξ）=F. At last, it shows the transforming process through an example.

关 键 词：自动机 正规文法 正则表达式 产生式 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]