Theory of Computation

Undergraduate

Finite Automata, regular expressions and languages; properties of regular languages; context-free grammars and languages; pushdown automata; properties of context-free languages. Introduction to 598 Winter 2027 Undergraduate Calendar Turing machines; recursive functions; undecidability. (Prerequisites: COMP-2140, COMP-2310 and COMP-2540.) (3 lecture hours a week)