Introduction to Theory of Computation (COM)

Catalog description

Introduction to a series of models for computation and their relationship to formal languages that are useful in the definition of programming languages along with a look at the theoretical limits of computers. Topics include finite and pushdown automata, Turing machines, grammars, decidability and computational complexity. Prerequisites: (CSC 215 or CSC 250 or CSC 251) and (CSC 255 or MATH 316 ).