Computer Language Theory

Prerequisites: MET CS 566 or consent of instructor. Theory of finite automata, regular expressions, and properties of regular sets. Context- free grammars, context-free languages, and pushdown automata. Turing machines, undecidability problems, and the Chomsky hierarchy. Introduction to computational complexity theory and the study of NP-complete problems.