The Construction Approach of Regular Expressions from Finite Automata Including Multi-Node Loops
The automaton theory has been widely applied in many areas of science, such as system simulations, neural networks, etc. It is also a basic theory of compiling routine for discriminating words of a programming language. This paper analyses the equivalence theorem between finite automata and regular expressions, points out the problem existing in the construction rules from finite automata to regular expressions, and proposes Jurther a construction approach from finite automata including multi-node loops to regular expressions. The usage of this theorem and the construction process of regular expressions are expatiated, and the principle of choosing loops and their simplification from finite automata to regular expressions are discussed in detail.
Finite automaton Regular expression Multi-node loop State transition diagram.
Jiming Ma Haibin Zhu Wenqian Shang
School of Computer and Communication Engineering, Zhengzhou Institute of Light Industry, Zhengzhou, Dept. of Computer Science and Mathematics, Nipissing University, North Bay, ON P1B 8L7, Canada School of Computer and Information Technology, Beijing Jiaotong University, 100044, China
国际会议
Firth IEEE International Conference on Cognitive Informatics(第五届认知信息国际会议)
北京
英文
771-776
2006-07-17（万方平台首次上网日期，不代表论文的发表时间）