University of Alabama at Birmingham
Finite-state automata and regular expressions, context-free grammars and pushdown automata, Turing machines, NP-completeness, Halting Problem.
3 credits
CS 350