CPTR 4210 - Thry of Computation

THEORY OF COMPUTATION (3)Regular expressions and languages; finite-state machines; formal grammars; regular, context-free, context-sensitive, and unrestricted grammars; pushdown automata; context-free languages; Turing machines; Church’s thesis; random-access machines; recursive functions; P- completeness problem; intractable problems. Additional course fee.Prerequisites: Math 2800/283Co-requisite: CPTR 3100/307

Credit Hours 3

Contact Hours 3

Prerequisites
MATH 2800

Corequisites
CPTR 3100