New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Strange behaviour #31
Comments
Yeah, the two are equivalent:
but obviously that's not the minimal regex. In fact computing a minimal regex is insanely hard computationally, I believe. I don't know if there's an effective procedure for doing that. I'll consider an extra reduction rule which can do that simplification. |
@ferno The computationally hard (worst-case exponential) but easy to implement in I didn't really expect |
Finding a minimal DFA using Brzozowski's algorithm is already part of |
@ferno I forgot that you have to convert DFA back to regex somehow. I see it was totally my misunderstanding. |
Well, it seems I still have some stupid questions to ask.
|
Oh, please, update the version available in |
Yes, I will. Sorry, I got involved in a long series of breaking changes and new features (and bumped the version number) but then I never really finished them, so I never published the new stuff to |
Version 3.0 of |
I don't see how
\d(\d{6})*\d{5}
differs from\d{6}
(neither I see why it's computed to be a minimal regex).The text was updated successfully, but these errors were encountered: