有限自动机的正则表达式的范式

The normal form of regular expressions of finite automata

强调了用正则表达式表示一个有限自动机的作用 ,给出了有限自动机的状态的正则表达式的范式 ,并证明了这种范式的存在性和唯一性 ,文中还给出了判定一个字符串是否在范式所表示的语言中的算法 ,以及利用正则表达式的范式求最小自动机的算法 .

This paper stresses on the effect of expressions of a finite automata with regular expressions.The normal form of regular expressions is given, the existence and the uniqueness of normal form of regular expressions is proven in this paper. The authors give an algorithm to decide a given string is in the language expressed by the normal form or not,also give an algorithm to extract minimal automaton by the normal form of regular expressions.