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.

Sign up for GitHub

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

Jump to bottom

Prove equivalence of regular expressions and finite automaton #7

Open

Steven1677 opened this issue Jul 19, 2022 · 0 comments

Labels

Collaborator

Steven1677 commented Jul 19, 2022

Finish the proof of equivalence of regular expressions and finite automaton.

Steven1677 added the enhancement label

Steven1677 added a commit that referenced this issue


          Add conversion from NFA to epsilon NFA

54b51b4

related #7

Steven1677 added a commit that referenced this issue


          Add conversion from RE to epsilon NFA

3d32c22

Related #7

Steven1677 added a commit that referenced this issue


          Add base cases for regular exp's proof

a7d27b7

Related #7

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment