Reading assignments are from Sipser, An Introduction to the Theory of Computation, second (or third) edition, available at the Textbook Annex.
Class meetings are MWF 1:25-2:15 in LGRC A203. There are two evening midterm exams -- the regular classes those days are cancelled though I am in fact using the first one as a makeup for a snow cancellation.
PART I: Regular and Context-Free Languages Wed 23 Jan L01 Course Overview (0.1) Fri 25 Jan L02 Basic Definitions (0.2) Mon 28 Jan L03 Review of Proof Techniques (0.3,0.4) Wed 30 Jan L04 Deterministic Finite Automata (1.1) Fri 01 Feb L05 Nondeterministic Finite Automata (1.2) Mon 04 Feb L06 Regular Expressions, Proof of Kleene's Theorem (1.3) (END OF ADD/DROP) Wed 06 Feb L07 Non-Regular Languages, Myhill-Nerode Theorem (1.4 plus) Fri 08 Feb --- NO CLASS (snow) Mon 11 Feb L08 Catchup on Chapter 1, Context-Free Languages and Grammars (2.1) Wed 13 Feb L09 Grammars and PDA's (2.1, 2.2) Fri 15 Feb L10 Equivalence of CFL's and PDA's (2.2) Mon 18 Feb --- NO CLASS (President's Day Holiday) Tue 19 Feb L11 (MONDAY SCHEDULE) Non-Context-Free Languages (2.3) Wed 20 Feb L12 Properties of the Context-Free Languages (2.3) Wed 20 Feb X01 FIRST MIDTERM (7-9 pm, room 142 CMPSCI building) on Lectures 1-12 PART II: Turing Machines and Computability Fri 22 Feb L13 Turing Machines, with Examples (3.1) Mon 25 Feb L14 Variants of Turing Machines (3.2) Wed 27 Feb L15 Representing Algorithms as Turing Machines (3.3) Fri 01 Mar L16 Decidable Languages (4.1) Mon 04 Mar L17 The Halting Problem (4.2) Wed 06 Mar L18 Proving Languages to be Undecidable (4.2) Thu 07 Mar --- Last Day to Drop With W Fri 08 Mar L19 Undecidable Problems in Formal Language Theory (5.1) Mon 11 Mar L20 Post's Correspondence Problem (5.2) Wed 13 Mar L21 Mapping Reducibility and More Undecidable Problems (5.3) Fri 15 Mar L22 The Recursion Theorem (6.1) SPRING BREAK Mon 25 Mar L23 Review of Chapters 4 and 5 Wed 27 Mar L24 A Definition of Information (6.4) Thu 28 Mar X02 SECOND MIDTERM (7-9 pm, room 142 CMPSCI building) on Lectures 13-24 PART III: Complexity Theory Fri 29 Mar --- NO CLASS (Makeup for second midterm) Mon 01 Apr L25 Time Complexity (7.1) Wed 03 Apr L26 The Class P (7.2) Fri 05 Apr L27 The Class NP (7.3) Mon 08 Apr L28 NP Completeness (7.4) Wed 10 Apr L29 The Cook-Levin Theorem (7.4) Fri 12 Apr L30 Some NP-Complete Problems (7.5) Mon 15 Apr --- NO CLASS (Patriots' Day Holiday) Wed 17 Apr L31 Space Complexity Definitions (8.1) (MONDAY SCHEDULE) Fri 19 Apr L32 The Class PSPACE and Savitch's Theorem (8.1,8.2,8.3) Mon 22 Apr L33 Logarithmic Space (8.4) Wed 24 Apr L34 Reachability, L, NL, NL-Completeness (8.4) Fri 26 Apr L35 Circuit Complexity (9.3) Mon 29 Apr L36 The NC and AC Classes (9.3,10.5) Wed 01 May L37 Course Review and Evaluations Thu 09 May FX Final Exam (cumulative) 10:30 am -12:30 pm, CMPSCI room 142
Last modified 21 February 2013