| 自动机与正规式相互转换的方法 |
| |
| 作者单位： | 吉林大学珠海学院 广东珠海519041 |
| |
| 摘 要： | 本文主要介绍基于编译器构造技术中的由正规表达式到最小化DFA的算法设计和实现技术,以及自动机转换正规式的方法。正规式与自动机理论以不同方式表达相同语言,两者相互转换在编译器构造过程中起至关重要的作用,也被广泛应用于计算机科学的各个领域。
|
| 关 键 词： | DFA NFA 正规表达式 子集构造法 |
The Method how Finite Automata and Regular Expression Switch each other |
| |
| MIAO Yu. The Method how Finite Automata and Regular Expression Switch each other[J]. Digital Community & Smart Home, 2008, 0(20) |
| |
| Authors: | MIAO Yu |
| |
| Abstract: | This thesis introduces the arithmetic design that how regular expression switches to minimum state DFA and the method how finite automata switches to regular expression. Regular expression and finite automata theory have different fashion to express the same language. They are more important in compiler formation and also have a lot of application in the other fields of computer science. |
| |
| Keywords: | DFA NFA regular expression Subset Construction Algorithm |
| 本文献已被 CNKI 等数据库收录！ |
