The Construction Approach of Regular Expressions from Finite Automata Including Multi-Node Loops

Author

Ma, Jiming ; Zhu, Haibin ; Shang, Wenqian

Author_Institution

Sch. of Comput. & Commun. Eng., Zhengzhou Inst. of Light Ind.

Volume

2

fYear

2006

fDate

17-19 July 2006

Firstpage

771

Lastpage

776

Abstract

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 further 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 expatriated, and the principle of choosing loops and their simplification from finite automata to regular expressions are discussed in detail

Keywords

finite automata; formal languages; automaton theory; equivalence theorem; finite automata; multinode loops; regular expressions; state transition diagram; Arithmetic; Automata; Communication industry; Computer industry; Computer languages; Computer networks; Computer science; Construction industry; Doped fiber amplifiers; Neural networks; Finite automaton; Multi-node loop; Regular expression; State transition diagram;

fLanguage

English

Publisher

ieee

Conference_Titel

Cognitive Informatics, 2006. ICCI 2006. 5th IEEE International Conference on

Conference_Location

Beijing

Print_ISBN

1-4244-0475-4

Type

conf

DOI

10.1109/COGINF.2006.365587

Filename

4216505