[syllabus] | [lecture notes] | [HW1-6,Q1] | [HW7-10,Q2,F] | [project]
[simulators/parsers] | [language definitions] | [automata definitions] | [computable definitions]
Lec Date Subject Reading --Homework--
assigned due
1 1/27 Introduction, terminology, definitions 1.1-1.5 HW1
2. 1/29 Continued Introduction and Overview 2.1
3. 2/3 Finite Automata and Regular Expressions 2.2 HW2 ---
4. 2/5 Nondeterministic Finite Automata 2.3 HW1
5. 2/10 NFA with Epsilon moves 2.5 HW3 HW2
6. 2/12 Construct regular expression from NFA 3.1
7. 2/17 RegExp to NFA, Moore and Mealy machines 3.2 HW4 HW3
8. 2/19 Pumping lemma for regular languages 4.1
9. 2/24 Regular set properties 4.2 study HW4
10. 2/26 Decision algorithms for regular sets 4.3
11. 3/2 Quiz 1 HW5
12. 3/4 Myhill-Nerode Theorem 4.4
13. 3/9 Context Free Grammars 5.1 HW6 HW5
14. 3/11 CFG derivation trees 5.2
15. 3/16 CFG simplification algorithm 7.1 HW6
16. 3/18 Chomsky normal form 7.1
17. 3/30 Greibach normal form 7.1
18. 4/1 Inherently ambiguous CFL's 7.4
19. 4/6 Quiz2
20. 4/8 Pushdown Automata 6.1 project
21. 4/13 CFG/CFL to NPDA 6.2 HW7
22. 4/15 NPDA to CFG/CFL 6.3
23. 4/20 Turing machine model 8.1,8.2
24. 4/22 CYK algorithm for CFG's 5.3 HW8 HW7
25. 4/27 CFL pumping lemma and properties 7.2,7.3 HW9
26. 4/29 Halting Problem, language, construction 9.2 HW10 HW8
27. 5/4 Church Turing Thesis 8.2
28. 5/6 Review HW9
Project
29. 5/13 Final Exam 3:30pm-5:30pm (no other) all late homework due. HW10
Last updated 4/27/04