CS 490 - Automata Theory and Formal Languages

Finite automata, regular and context free grammars, the pumping theorem, Turing machines, undecidability, LR grammars, complexity theory, NP-completeness.

Prerequisite: A grade of C or better in CS 291 - Models of Computation.
Credit(s): 3
Course Attribute(s):

Honors Scholar Course.