This project simulates the behavior of a nondeterministic finite automaton to determine whether a string is in a particular defined language. The program uses an algorithm to convert the nfa (defined through the nfa txt files), into an equivalent dfa. The function from project 1 (dfa simulator) is called to similarly verify the string.
-
Notifications
You must be signed in to change notification settings - Fork 0
justincavalli/NFA-Simulator
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published