-
Notifications
You must be signed in to change notification settings - Fork 6
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
Inclusion test with shortest words #201
base: devel
Are you sure you want to change the base?
Conversation
The test right now is not implemented very nicely, probably could be done more effeciently. |
|
Seems like it is slower with the inefficient implementation, we could probably make it as fast as normal inclusion test, but it will not help us (on smt benchmarks). |
The enumeration of shortest words might be expensive. Maybe we could think about some compact representation of shortest words (e.g., by taking the original NFA, remove some states and transitions in order to get only shortest words). Then the inclusion checking should be similarly expensive as the original one (probably even faster). |
Yeah, I was thinking about the compact representation too. |
Trying to replace inclusion test in stabilization algorithm with inclusion test based on shortest words (which should be complete for SAT non-chan-free word equations + regular constraints).