Reading Assignments

From the 3rd edition of M. Sipser's Theory of Computation

• Week of November 9th. Definition of mapping reducibility (Pages 234-235)
• Week of November 2nd. Decidability and Undecidability (Chapter 4 pages 193-208)
• Week of October 19th and 26th. Turing Machines (Chapter 3 Sections 1,2)
• Week of October 12th. Context Free Languages and Grammars (Section 2.1)
• Week of September 28th Regular Expressions and their equivalence with Finite Automata (Section 1.3)
• Week of September 21st Language Operations and Regular Expressions (Section 1.3)
• Week of September 14th: Regular Expressions (Chapter 1, Section 1.3 up to page 66)
• Week of September 7th: Nondeterministic finite automata (Chapter 1, Section 1.2)
• Week of August 31st: Deterministic finite automata (Chapter 1, Section 1.1)
• Week of August 24th: Review of Sets, Functions, and Logic (Chapter 0, pages 1-16)