CSC 341 - Automata, Formal Languages, and Computational Complexity

4 credits (Fall and Spring)

A formal study of computational devices, their related languages, and the possibility and difficulty of computations. Examples are pushdown automata and Turing machines, context-free languages and recursively enumerable sets, and the halting problem and NP-completeness.

Prerequisite: CSC 207 and either MAT 218,

CSC 208

or MAT 208; with grade S, C, or better.
Instructor: Autry, Eikmeier, Osera