This project aims to convert a Non-deterministic Finite Automaton (NFA) into a Deterministic Finite Automaton (DFA) and provide functionality to test strings against the resulting DFA. The tool utilizes the Graphviz library to visualize the DFA.
-
Notifications
You must be signed in to change notification settings - Fork 0
This project aims to convert a Non-deterministic Finite Automaton (NFA) into a Deterministic Finite Automaton (DFA) and provide functionality to test strings against the resulting DFA. The tool utilizes the Graphviz library to visualize the DFA.
Praveen20cent/NFAtoDFA
About
This project aims to convert a Non-deterministic Finite Automaton (NFA) into a Deterministic Finite Automaton (DFA) and provide functionality to test strings against the resulting DFA. The tool utilizes the Graphviz library to visualize the DFA.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published