Abstract
A Finite Automata (FA) and Regular Expression (RE) are the theoretical principle of the lexical analysis of the compiling technique, and they are equivalent each other. This paper analyzes the basic substitution rules and the general steps of the transforming from FA into RE, and explores a new idea: cycle-broken method. On the basis of it, we add two new substitution rules. The rules extend three original rules to five rules, and simplify the transforming FA into RE. Finally, we have illustrated the application of cycles-broken method by an example.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
