304_Reading_F11

304_Reading_F11 - PART 2: Computability Theory Chapters 3 -...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
UML CS Fall, 2011 Foundations of Computer Science 91.304 (Section 201) Lecture Date Topic Reading Homework F 9/2, W 9/7 Preliminaries Chapter 0 9/2: assign #1 (Ch 0) F 9/9 Quiz (in class) Chapter 0 9/9: #1 due; assign #2 (1.1-1.2) PART 1: Automata and Languages Chapters 1 - 2 Regular Languages Chapter 1 M 9/12, W 9/14 Finite Automata 1.1 F 9/16, M 9/19 Nondeterminism 1.2 W 9/21, F 9/23, M 9/26 Regular Expressions 1.3 9/21: #2 due; assign #3 (1.3-1.4) W 9/28, F 9/30 Nonregular Languages 1.4 Context-Free Languages Chapter 2 M 10/3, W 10/5, F 10/7 Context-Free Grammars 2.1 10/3: #3 due; assign #4a (2.1-2.2) W 10/12, F 10/14 Pushdown Automata 2.2 M 10/17, W 10/19 Non-context-free Languages 2.3 10/17: #4a due; assign #4b (2.3) Review (outside of class) Chapters 0 – 2 F 10/21 Midterm Exam (in class) Chapters 0 – 2 10/21: #4b due
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: PART 2: Computability Theory Chapters 3 - 5 Church-Turing Thesis Chapter 3 M 10/24, W 10/26, F 10/28 Turing Machines 3.1 10/24: assign #5 (3.1-3.3) M 10/31, W 11/2 Variants of Turing Machines 3.2 F 11/4 Algorithm Definition 3.3 Decidability Chapter 4 M 11/7, W 11/9, F 11/11 Decidable Languages 4.1 11/7: #5 due; assign #6 (4.1-4.2) M 11/14, W 11/16, F 11/18 Halting Problem 4.2 Reducibility Chapter 5 M 11/21, W 11/23, M 11/28 Undecidable Problems from Language Theory 5.1 11/21: #6 due; assign #7 (5.1) W 11/30, F 12/2, M 12/5 A Simple Undecidable Problem 5.2 11/30: #7 due; assign #8 (5.2-5.3) W 12/7, F 12/9 Mapping Reducibility 5.3 M 12/12 Review (in class) Chapters 0 5 12/12: #8 due To Be Determined Final Exam Chapters 0 5 Note that we are using the second edition of the textbook....
View Full Document

Ask a homework question - tutors are online