Use Turing machine to simulate Deterministic Finite Automata (DFA), Nondeterministic Finite Automata (NFA), and Nondeterministic Pushdown Automata (NPDA) to accept certain strings. To run the jff files, you can download the latest version of JFLAP here: http://www.jflap.org/jflaptmp/
-
Notifications
You must be signed in to change notification settings - Fork 0
LeDuy-Vu/CS-154-Homework
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Collection of 3 solo homework assignments from my Formal Languages and Computability class.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published