Regular expressions Equivalence
algorithm, dfa, regex
Solution
To test equivalence you can compute the minimal DFAs for the expressions and compare them.
Problem
Is there a way to find out if two arbitrary regular expressions are equivalent? Looks like complex problem to me, but there might be some DFA simplification mechanism or something?