Research on a Reformation of Converting FAM to Regular Expression
HU Wei-qiang · Journal of Zhongyuan University of Technology · 2008
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.