feat: prepare for proving the closure of omega-regular languages under complementation #268
+66
−0
Conversation
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
…r complementation
ctchou
force-pushed
the
omega-saturation
branch
from
d96e56d to
84a294e
Compare
chenson2018
requested changes
Jan 17, 2026
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
This PR lays some groundwork for proving the closure of omega-regular languages under complementation. The main result is
IsRegular.fin_cover_saturates_complinOmegaRegularLanguage.lean, which depends on the definition and theorems inSaturation.lean.In future work we will construct a right congruence of finite index on finite words so that the index type
IinIsRegular.fin_cover_saturates_complconsists of pairs of equivalence classes of this congruence.