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