Thursday, September 2

Given the makeup of the class we decided to quickly review the earlier chapters of the Sipser book in order to ensure that all students

bulletrecall the main issues of regular and context free languages and their models of computation.
bulletare familiar and comfortable with the mathematical notation of the theory of computing
bulletbecome comfortable with reading and understanding definitions, lemmas, and theorems
bulletcan apply standard techniques to prove lemmas and theorems.

We thus spent this class period reviewing regular languages and finite state automata.