Skip to content

Latest commit

 

History

History
2 lines (2 loc) · 303 Bytes

README.md

File metadata and controls

2 lines (2 loc) · 303 Bytes

CS-154-Homework

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/