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