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/
LeDuy-Vu/CS-154-Homework
Collection of 3 solo homework assignments from my Formal Languages and Computability class.