|
| |||
|
|
|||
|
| |||
|
| |||
| Week | Reading | Topics & Transparencies | Hints |
| 1 | Preface; 2 |
Introduction
(Chapter 1: Math Prerequisites, as needed) Chapter 2: Propositional Logic |
2 |
| 2 | 3 | Chapter 3: Proofs with Propositional Logic | 3 |
| 3 | 4 | Chapter 4: Predicate Logic | 4 |
| 4 | 7 | Chapter 7: Prolog | 7 |
| 5 | 5 | Chapter 5: Proofs with Predicate Logic | 5 |
| 6 | 6 -> 6.3 | Chapter 6: Verification | 6 |
| 7 | start 8 |
MIDTERM EXAM
Prolog to Language: The Transition |
|
| 8 | 8; start 9 | Chapter 8: Language Models | 8 |
| 9 | 9 | Chapter 9: Finite Automata | 9 |
| 10 | 10 | Chapter 10: Regular Expressions | 10 |
| 11 | 11 | Chapter 11: Lex | 11 |
| 12 | 12 | Chapter 12: Context-Free Grammars | 12 |
| 13 | 13 -> 13.4 | Chapter 13: Pushdown Automata | 13 |
| 14 | 14: intro, 4, 6 | Chapter 14: Turing Machines | 14 |