Inclusion test with shortest words - #201
Draft
jurajsic wants to merge 1 commit into
Draft
Conversation
Member
Author
|
The test right now is not implemented very nicely, probably could be done more effeciently. |
Member
Author
|
Member
Author
|
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). |
Collaborator
|
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). |
Member
Author
|
Yeah, I was thinking about the compact representation too. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.

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).