Is there any solution that can compare two regular expressions for Subsumption, partially overlapping, disjoint, i.e. I want to know how to compare two regular expressions. Secondly, I can combine two regular expressions if regular expression 1 is omitted by regular expression 2.
Say you have two expressions A and B and want to see if A matches a subset of what B. does.
You need to calculate the minimized DFA B and then combine the two expressions to make the union of A and B, and then calculate the minimized DFA of this new expression. If these two DFAs are equal, then A corresponds to a subset of B.
In essence, you cannot verify this correctly without going through the process of constructing minimized automata. Nevertheless, he will give a reliable correct answer to the question.
A combination of the two expressions can be done by creating a new expression like (A)|(B) , possibly replacing the paranthesis for non-exciting varieties if your engine supports this.
(A)|(B)
If you decide to go all the way to execute the algorithms, I wrote a number of articles on this process:
http://binarysculpting.com/2012/02/11/regular-expressions-how-do-they-really-work-automata-theory-for-programmers-part-1/
http://binarysculpting.com/2012/02/15/converting-dfa-to-nfa-by-subset-construction-regular-expressions-part-2/
http://binarysculpting.com/2012/03/21/dfa-state-minimization/
To compare two automata, you can simply check that the states and transitions are the same. They must be exactly equal.