This shows you the differences between two versions of the page.
courses:theory2021:main [2021/03/15 22:11] tsay2 [Announcements] |
courses:theory2021:main [2021/11/09 09:37] (current) tsay2 [Announcements] |
||
---|---|---|---|
Line 3: | Line 3: | ||
=====Announcements===== | =====Announcements===== | ||
+ | * 07/01: grade report available; please send inquiries, if any, to the instructor by 5PM 07/02. | ||
+ | * 06/21: slides from TA sessions: {{courses:theory2021:hw6_10.pdf|HW#6-10}}. | ||
+ | * 06/21: notes/slides for More NP-Complete Problems available. | ||
+ | * 06/08: slides from TA sessions: {{courses:theory2021:hw6_9.pdf|HW#6-9}}. | ||
+ | * 06/02: {{courses:theory2021:hw10.pdf|HW#10}} due on 06/15. | ||
+ | * 05/24: notes/slides for Time Complexity and NP-Completeness available. | ||
+ | * 05/24: {{courses:theory2021:hw9.pdf|HW#9}} due on 06/01. | ||
+ | * 05/18: notes/slides for Reducibility available. | ||
+ | * 05/11: {{courses:theory2021:hw8.pdf|HW#8}} due on 05/18. | ||
+ | * 05/11: {{courses:theory2021:theory2021mid_s.pdf|Suggested Solutions to Midterm Problems}} available. | ||
+ | * 05/04: notes/slides for Decidability available. | ||
+ | * 05/04: {{courses:theory2021:hw7.pdf|HW#7}} due on 05/11. | ||
+ | * 04/27: notes/slides for Turing Machines available. | ||
+ | * 04/13: old exams: {{courses:theory:old_exams.zip|2000-2020}}. (Note: I didn't offer the course some of the years.) | ||
+ | * 04/13: slides from TA sessions: {{courses:theory2021:hw1_5.pdf|HW#1-5}}. | ||
+ | * 04/12: {{courses:theory2021:hw6.pdf|HW#6}} due on 04/27. | ||
+ | * 03/30: {{courses:theory2021:hw5.pdf|HW#5}} due on 04/13. | ||
+ | * 03/22: notes/slides for Context-Free Languages and Pushdown Automata available. | ||
+ | * 03/22: {{courses:theory2021:hw4.pdf|HW#4}} due on 03/30. | ||
+ | * 03/15: TA session of 3/16 postponed to 3/23. | ||
* 03/15: {{courses:theory2021:hw3.pdf|HW#3}} due on 03/23. | * 03/15: {{courses:theory2021:hw3.pdf|HW#3}} due on 03/23. | ||
* 03/15: slides for Minimization of DFAs available. | * 03/15: slides for Minimization of DFAs available. | ||
Line 38: | Line 58: | ||
(Note: a TA | (Note: a TA | ||
session will precede a class meeting whose date is marked with an *. There | session will precede a class meeting whose date is marked with an *. There | ||
- | are four TA sessions on 03/16, 04/13, 05/18, and 06/08.) | + | are four TA sessions on 03/23, 04/13, 05/18, and 06/08.) |
*Introduction and Mathematical Preliminaries (1.5 weeks: 02/23, 03/02a) [{{courses:theory2021:ch0_notes.pdf|notes}}, {{courses:theory2021:ch0_slides.pdf|slides}}] | *Introduction and Mathematical Preliminaries (1.5 weeks: 02/23, 03/02a) [{{courses:theory2021:ch0_notes.pdf|notes}}, {{courses:theory2021:ch0_slides.pdf|slides}}] | ||
- | *Finite Automata and Regular Languages (2.5 weeks: 03/02b, 03/09, 03/16*) [{{courses:theory2021:ch1_notes.pdf|notes}}, {{courses:theory2021:ch1_slides.pdf|slides}}, appendix:{{courses:theory2021:ch1_minimization.pdf|minimization}}] | + | *Finite Automata and Regular Languages (2.5 weeks: 03/02b, 03/09, 03/16) [{{courses:theory2021:ch1_notes.pdf|notes}}, {{courses:theory2021:ch1_slides.pdf|slides}}, appendix:{{courses:theory2021:ch1_minimization.pdf|minimization}}] |
- | *Context-Free Languages and Pushdown Automata (3 weeks: 03/23, 03/30, 04/13*) [{{courses:theory2021:ch2_notes.pdf|notes}},{{courses:theory2021:ch2_slides.pdf|slides}}] | + | *Context-Free Languages and Pushdown Automata (3 weeks: 03/23*, 03/30, 04/13*) [{{courses:theory2021:ch2_notes.pdf|notes}},{{courses:theory2021:ch2_slides.pdf|slides}}] |
* **Midterm** (**2021/04/20**) | * **Midterm** (**2021/04/20**) | ||
*Turing Machines (2 weeks: 04/27, 05/04) [{{courses:theory2021:ch3_notes.pdf|notes}}, {{courses:theory2021:ch3_slides.pdf|slides}}] | *Turing Machines (2 weeks: 04/27, 05/04) [{{courses:theory2021:ch3_notes.pdf|notes}}, {{courses:theory2021:ch3_slides.pdf|slides}}] |