Apr 23, 2024  
2017-2018 General/Graduate Catalog - Expires August 2023 
    
2017-2018 General/Graduate Catalog - Expires August 2023 [Archived Catalog]

Add to Portfolio (opens a new window)

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 .
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)