| 由有穷自动机构造正则表达式的新算法 |
| |
| 引用本文： | 王建平,刘延杰. 由有穷自动机构造正则表达式的新算法[J]. 计算机应用与软件, 2003, 20(10): 86-87 |
| |
| 作者姓名： | 王建平 刘延杰 |
| |
| 作者单位： | 烟台师范学院计算机科学与技术学院,烟台,264025 |
| |
| 摘 要： | 本文借助图论的理论，通过识别回路和不包含回路的由起始状态到终止状态的路径的方法，提出一种构造给定有穷自动机对应的正则表达式的新算法，并给出具体实例。
|
| 关 键 词： | 自动机理论 有穷自动机 正则表达式 算法 计算机科学 |
A NEW ALGORITHM OF REGULAR EXPRESSION FORMULATED FROM FINITE AUTOMATA |
| |
| Wang Jianping Liu Yanjie. A NEW ALGORITHM OF REGULAR EXPRESSION FORMULATED FROM FINITE AUTOMATA[J]. Computer Applications and Software, 2003, 20(10): 86-87 |
| |
| Authors: | Wang Jianping Liu Yanjie |
| |
| Abstract: | 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. |
| |
| Keywords: | Finite automata Regular expression Graph theory Path Cycle |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
