"Matching of regular expressions is NP-complete. As such you can solve any other NP problem using regular expressions."
Would love to see that be the mechanism of that proof.
Seriously though, wonderful work.