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.

Credit(s): 3
Prerequisite(s): Prerequisite: A grade of C or better in CS 291 - Models of Computation.
Disciplinary Perspective(s):
None
Interconnecting Perspective(s):
None
University Graduation Requirement(s):
Honors Scholar