-
Notifications
You must be signed in to change notification settings - Fork 48
feat: prove that regular languages are closed under Kleene star #241
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
Open
ctchou
wants to merge
13
commits into
leanprover:main
Choose a base branch
from
ctchou:na-kstar
base: main
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
+103
−16
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
Contributor
Author
|
Rebase on #239. |
Contributor
Author
|
Rebase on #239 again. |
Contributor
Author
|
Rebase on #239. |
chenson2018
reviewed
Jan 8, 2026
github-merge-queue bot
pushed a commit
that referenced
this pull request
Jan 9, 2026
In this patch we prove that regular languages are closed under concatenation, by leveraging the results already proved about the infinite executions of the automata concatenation construction in `NA/Concat.lean`. In order to do so, we introduce the notion of a "total LTS", which means that the LTS has a next state for any given starting state and label, and a "LTS.totalize" construction that converts any LTS into a total LTS by adding a sink state and transitions from all states to the sink state. Then the notion of "total" and the "totalize" construction are generalized to NA. By "totalizing" NA's, we can extend any finite execution of a NA into an infinite execution and thus re-use the results already proved for infinite executions. The same technique can be applied to `NA/Loop.lean` to prove that regular languages are closed under the Kleene star; see PR #241.
chenson2018
requested changes
Jan 9, 2026
… the move to the new module system)
Contributor
Author
|
Merge in |
chenson2018
approved these changes
Jan 12, 2026
Collaborator
chenson2018
left a comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
My style comments have been addressed.
Contributor
Author
|
@fmontesi, could you review this PR? Chris has approved it. Thanks! |
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.
This patch proves that regular languages are closed under Kleene star. The proof technique is similar to the one used in PR #239 and re-uses much of the infrastructure introduce in that PR.