[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/26 Introduction, terminology, definitions 1.1-1.5 HW1
2. 1/28 Continued Introduction and Overview 2.1
3. 2/2 Finite Automata and Regular Expressions 2.2 HW2
4. 2/4 Nondeterministic Finite Automata 2.3 HW1
5. 2/9 NFA with Epsilon moves 2.5 HW3 HW2
6. 2/11 Construct regular expression from NFA 3.1
7. 2/16 RegExp to NFA, Moore and Mealy machines 3.2 HW4 HW3
8. 2/18 Pumping lemma for regular languages 4.1
9. 2/23 Regular set properties 4.2 study HW4
10. 2/25 Decision algorithms for regular sets 4.3
11. 3/2 Quiz 1 HW5
12. 3/4 Myhill-Nerode Theorem 4.4 Quiz1
13. 3/9 Context Free Grammars 5.1 HW6 HW5
14. 3/11 CFG derivation trees 5.2
Spring Break
15. 3/23 CFG simplification algorithm 7.1 HW6
16. 3/25 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 quiz2
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
25. 4/27 CFL pumping lemma and properties 7.2,7.3 HW9 HW7
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/11 final all due 5/18 HW10
5/18 all homework, project, quiz must be submitted final
Last updated 4/27/2021