Mathematical models of computation, including finite automata and Turing machines.
This course examines the theoretical foundations of computing. In it we examine a series of models of computation, including finite automata, push-down automata, and Turing machines. For each model we generate an equivilent grammer. We also determine each model's computational `power' by examining what languages it is capable of recognizing.
This course meets from 11:30-12:20 on MWF in TLC 047.
Other course information
Course syllabus by week This includes assignments,
readings, etc. It will be added to as the course
continues.