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