Comparisons Amongst Different Techniques for Conversion of Deterministic Finite Automata to Regular Expression.

Regular expression is widely used in the field of computer science. For conversion of deterministic finite automata to regular expression, several techniques like Transitive closure method, Brzozowski Algebraic method and state elimination method are proposed. None of the proposed techniques is able to find the smallest regular expression. This paper investigates and compares different techniques for converting deterministic finite automata to regular expression. Inclusion of bridge state method in state elimination method leads to smaller regular expression as compared to other techniques. [ABSTRACT FROM AUTHOR]