Jul 12, 2025  
2008-2009 General/Graduate Catalog - Expires August 2014 
    
2008-2009 General/Graduate Catalog - Expires August 2014 [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: CS 291.
Credits: 3 hours
NOTE: General Honors Course.
NOTE: This course counts toward the 63-hour Liberal Arts and Sciences (LAS) graduation requirement.



Add to Portfolio (opens a new window)