由有穷自动机构造正则表达式的新算法

A NEW ALGORITHM OF REGULAR EXPRESSION FORMULATED FROM FINITE AUTOMATA

本文借助图论的理论 ,通过识别回路和不包含回路的由起始状态到终止状态的路径的方法 ,提出一种构造给定有穷自动机对应的正则表达式的新算法 ,并给出具体实例。

In this paper,a new algorithm was presented about how to formulate a regular expression for a given finite automata.The new algorithm was derived from the methods of identifying cycles and the path from start state to end state which do not include cycle based on the graph theory.At the end of the paper an example was given to illustrate the algorithm.