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

Research on a Reformation of Converting FAM to Regular Expression

有限自动机与正则表达式具有等价性,针对传统算法在处理特定有限自动机正则化中的缺陷,通过对终止状态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.