|
CS 570 - Theory of Computation 1.
Mathematical logic; alphabets and languages; finite automata, regular and nonregular languages, and Kleene's theorem; regular grammars; pushdown automata and context-free grammars; Turing and Post machines; recursive and recursively enumerable languages; the Chomsky Hierarchy. Prerequisite: CS 324 or permission of the instructor. Not open to students who have credit in CS 470. College: Sciences & Humanities Hours: 3 Permission: Y Prerequisite: CS 324 Co-requisite: none |