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: CS 291.
Credits: 3 hours
NOTE: Honors Scholar Course.
NOTE: This course counts toward the 63-hour Liberal Arts and Sciences (LAS) graduation requirement.