3 Credits
Study models of computation that include Turing machines, pushdown automata, and finite automata. Learn grammars and formal languages, such as context-free and regular set. Better understand important problems, including language equivalence theorems and the halting problem.