A review of finite automata. A rigorous treatment of regular languages including closure properties and the Pumping Lemma. An investigation of context-free languages, context-free grammars, simplification of grammars, normal forms and related topics. Turing machines and the Halting Problem. Applications to lexical analysis.
Credit 4 hrs May not be repeated for additional credit hours Grade Mode Normal (A-F)
Prerequisite(s)COSC 311 and COSC 314 Class-Level Restriction Undergraduate standing
Updates Change to credit hours and class-level restriction 2/2017, effective Fall 2017; Graduate Credit Rescinded 3/2015, effective Fall 2015; Graduate Credit 7/2011