Skip to content
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

FEAT: NFA to DFA #8

Closed
Zakrok09 opened this issue Mar 29, 2024 · 0 comments · Fixed by #9
Closed

FEAT: NFA to DFA #8

Zakrok09 opened this issue Mar 29, 2024 · 0 comments · Fixed by #9
Assignees
@Zakrok09
Labels
enhancement New feature or request
Milestone
Regular Languages

Comments

@Zakrok09
Copy link
Owner

Problem

There is no way to convert a NFA in to a DFA.

Possible solutions

Create an algorithm to convert NFAs to DFAs using the Sipser's algorithm described in "Introduction to the Theory of Computation"
@Zakrok09 Zakrok09 added the enhancement New feature or request label Mar 29, 2024
@Zakrok09 Zakrok09 added this to the Regular Languages milestone Mar 29, 2024
@Zakrok09 Zakrok09 self-assigned this Mar 29, 2024
@Zakrok09 Zakrok09 linked a pull request Mar 30, 2024 that will close this issue
v0.3.0 #9
Merged
@Zakrok09 Zakrok09 mentioned this issue Apr 3, 2024
Merged
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@Zakrok09 Zakrok09

Labels
enhancement New feature or request
Projects
None yet
Milestone
Regular Languages
Development

Successfully merging a pull request may close this issue.

v0.3.0 Zakrok09/ts-automata
1 participant
@Zakrok09