|
Sep 29, 2024
|
|
|
|
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 - Models of Computation . Credits: 3 NOTE:
* Honors Scholar Course.
** This course counts toward the 63-credit Liberal Arts and Sciences (LAS) graduation requirement.
Add to Portfolio (opens a new window)
|
|