Finite state machines, regular languages, regular expressions, applications of regular languages, grammars, context-free languages, models of computation, introduction to complexity theory. Three lectures, one tutorial (two hours); first term Prerequisite(s): COMP SCI 1FC3 or registration in the Mathematics and Computer Science program
