New heuristics for conversion of Deterministic finite automata to Regular expression

Tamanna Chhabra, Ajay Kuymar


Every deterministic finite automata can be converted into regular expression and vice versa.Various techniques like Transitive closure method, Brzozowski algebraic and State elimination exist for conversion of deteministic finite automata to regular expression. In state elimination method concept of bridge state, horizontal chopping and vertical chopping are used for obtaining smaller regular expressions from deterministic finite automata. In this research paper, new heuristic is discussed using which a smaller regular expression can be generated. Relationship between the size of deterministic finite automata and size of regular expression is estimated..

Keywords: Deterministic finite automata, regular expression ,circles

Full Text:




  • There are currently no refbacks.

Copyright (c) 2016 International Journal of Advanced Research in Computer Science