The Method how Finite Automata and Regular Expression Switch each other
Miao Yu · Computer Knowledge and Technology · 2008
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.