Fall 2009 Schedule (tentative)
Unit 1: Finite Automata and Regular Languages
| WEEK | DATE | TOPIC | READING | HOMEWORK |
| 1 | 8/25 | Basic concepts and deterministic finite automata | Linz pp. 10-13 on proof techniques, section 1.2 | |
| 8/27 | Languages, Grammars, DFAs | JFLAP 1.1-1.7, 2.1 |
||
| 2 | 9/1 | Regular languages and nondeterministic finite automata | Linz 2.1-2.2 |
[Homework 1] due |
| 9/3 | CLASS CANCELLED | |||
| 3 | 9/8 | Equivalence of DFA and NFA, Regular expressions, equivalence of regular expressions and regular languages | Linz 2.3, 3.1, 3.2 JFLAP 3.1 - 3.6 |
[Homework 2] due |
| 9/10 | Regular grammars and regular languages, regular language properties | Linz 3.3, 4.1 JFLAP review 1, 2.1, 3, 4 |
||
| 4 | 9/15 | Regular language properties, nonregular languages, pumping lemma for regular languages | Linz 4.2 - 4.3 JFLAP review 1, 2.1, 3, 4 |
[Homework 3] due |
Unit 2: Pushdown Automata and Context Free Languages
| WEEK | DATE | TOPIC | READING | HOMEWORK |
| 4 | 9/17 | QUIZ 1, Context-free grammars, derivations, parsing, membership, and ambiguity | Linz 5.1-5.2 JFLAP 6.1 |
|
| 5 | 9/22 | Ambiguity, transforming grammars, substitution, removing useless productions, removing simple productions | Linz 5.2, 5.3, and 6.1 JFLAP 7.1-7.3 |
[Homework 4] due |
| 9/24 | Chomsky |
Linz 6.2 JFLAP 7.4-7.5 |
||
| 6 | 9/29 | Nondeterministic pushdown automata | Linz 7.1 JFLAP 5.1-5.4 |
[Homework 5] due |
| 10/1 | Pushdown automata and context-free languages | Linz 7.2 JFLAP 6.2-6.3 |
||
| 7 | 10/6 | Pushdown automata and context-free languages, continued | Linz 7.3 JFLAP review 5-7 |
[Homework 6] due |
| 10/8 | MIDTERM 1 | |||
| 8 | 10/13 | Creating grammars from pushdown automata, deterministic pushdown automata, | Linz 8.1 | No homework due |
| 10/15 | Deterministic pushdown automata, Pumping lemmas for context-free languages and linear languages | Linz 8.1 | ||
| 9 | 10/20 | Closure and decidable properties for context-free languages | Linz 8.2 | [Homework 7] due |
| 10/22 | Wrap up context-free languages | Linz 9.1 JFLAP 9.1-9.2 |
Unit 3: Turing Machines and Computability
| WEEK | DATE | TOPIC | READING | HOMEWORK |
| 10 | 10/27 | Turing machines, Turing machines as language acceptors | Linz 9.2-9.3 | [Homework 8] due |
| 10/29 | QUIZ 2, Implementing complex tasks with Turing machines, Turing's thesis | Linz 9.2 - 9.3 | ||
| 11 | 11/3 | Turing machine variations | Linz 10.1-10.2 JFLAP 9.3-9.5 |
[Homework 9] due |
| 11/5 | Non-determinism, universal Turing machine and linear bounded automata | Linz 11.1 JFLAP 11.1 |
||
| 12 | 11/10 | Recursive languages and recursively enumerable languages, unrestricted grammars, context sensitive grammars, Chomsky hierarchy | Linz 11.1-11.4 JFLAP 11.2-11.3 |
[Homework 10] due |
| 11/12 | MIDTERM 2 |
Unit 4: Computational Limits and Complexity
| WEEK | DATE | TOPIC | READING | HOMEWORK |
| 13 | 11/17 | Recursive languages and recursively enumerable languages, unrestricted grammars, context sensitive grammars, Chomsky hierarchy | Linz 11.1-11.4 | No homework due |
| 11/19 | Wrap up language hierarchy. Computability, decidability, reductions | Linz 12.1-12.2 | ||
| 14 | 11/24 | FALL BREAK | ||
| 11/26 | FALL BREAK | |||
| 15 | 12/1 | Complexity | Linz 14.1-14.3 | [Homework 11] due |
| 12/3 | P and NP | Linz 14.4-14.7 | ||
| 16 | 12/8 | QUIZ 3, P and NP | [Homework 12] due | |
| 12/10 | Final review |