Only if the regexes determine a limited number of strings, you can perhaps work backward and calculate the set of acceptable strings for the "A" regex and the "B" regex. If both sets are the same, you have proven your point.
CountZero
"If you have four groups working on a compiler, you'll get a 4-pass compiler." - Conway's Law
In reply to Re: Comparative satisfiability of regexps.
by CountZero
in thread Comparative satisfiability of regexps.
by Meowse
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |