CSC 445/545 Introduction to Theory of Computation

Credits: (3-0) 3

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 251
Notes: Students enrolled in CSC 545 will be held to a higher standard than those enrolled in CSC 445.

Check course scheduling information