CS 470 - Theory of Computation 1

Mathematical logic; alphabets and languages; finite automata, regular and nonregular languages, Kleene's theorem; regular grammars; pushdown automata and context-free grammars; Turing and Post machines; recursive and recursively enumerable languages; the Chomski Hierarchy. Prerequisite: CS 324.

College: Sciences and Humanities
Hours: 3
Permission: Y
Prerequisite: CS 324
Co-requisite: none