Courses

CSCI-5444 (3) Introduction to Theory of Computation

Reviews regular expressions and finite automata. Studies Turing machines and equivalent models of computation, the Chomsky hierarchy, context-free grammars, push-down automata, and computability. Prereq., graduate standing or instructor consent. Prerequisites: Restricted to graduate students or Computer Science Concurrent Degree majors only.