User Tools
courses:theory2023:main
Differences
This shows you the differences between two versions of the page.
|
courses:theory2023:main [2023/01/09 21:05] tsay2 [TA] |
courses:theory2023:main [2023/09/04 22:19] (current) tsay2 [Announcements] |
||
|---|---|---|---|
| Line 3: | Line 3: | ||
| =====Announcements===== | =====Announcements===== | ||
| + | * 06/13: grade report available; please send inquiries, if any, to the instructor by 5PM 06/15. | ||
| + | * 05/31: slides from TA sessions: {{courses:theory2023:hw6-10_s.pdf|HW#6-10}}. | ||
| + | * 05/23: {{courses:theory2023:hw10.pdf|HW#10}} due 1:20PM 05/30. | ||
| + | * 05/16: notes/slides for Time Complexity and NP-Completeness available. | ||
| + | * 05/16: {{courses:theory2023:hw9.pdf|HW#9}} due 05/23. | ||
| + | * 05/09: notes/slides for Reducibility available. | ||
| + | * 05/08: {{courses:theory2023:hw8.pdf|HW#8}} due 05/16. | ||
| + | * 05/02: notes/slides for Decidability available. | ||
| + | * 05/02: {{courses:theory2023:theory2023mid_s.pdf|Suggested Solutions to Midterm Problems}} available. | ||
| + | * 05/02: {{courses:theory2023:hw7.pdf|HW#7}} due 05/09. | ||
| + | * 04/25: notes/slides for Turing Machines available. | ||
| + | * 04/12: {{courses:theory2023:hw6.pdf|HW#6}} due 04/25. | ||
| + | * 04/12: slides from TA sessions: {{courses:theory2023:hw1-5_s.pdf|HW#1-5}}. | ||
| + | * 04/12: old exams: {{courses:theory:old_exams.zip|2000-2022}}. (Note: I didn't offer the course some of the years.) | ||
| + | * 03/28: {{courses:theory2023:hw5.pdf|HW#5}} due 1:20PM 04/11. | ||
| + | * 03/28: {{courses:theory2023:hw4.pdf|HW#4}} due 1:20PM 04/11. | ||
| + | * 03/28: notes/slides for Context-Free Languages and Pushdown Automata available. | ||
| + | * 03/21: {{courses:theory2023:hw3.pdf|HW#3}} due 2:20PM 03/28. | ||
| + | * 03/14: {{courses:theory2023:hw2.pdf|HW#2}} due 1:20PM 03/21. | ||
| + | * 03/06: notes/slides for Finite Automata and Regular Languages available. | ||
| + | * 03/06: {{courses:theory2023:hw1.pdf|HW#1}} due on 03/14. | ||
| + | * 02/21: notes/slides for Introduction and Mathematical Preliminaries available. | ||
| + | * 02/18: this website created to complement the NTU COOL site for this course. | ||
| =====Instructor===== | =====Instructor===== | ||
| [[http://im.ntu.edu.tw/~tsay/|Yih-Kuen Tsay (蔡益坤)]], NTU IM Dept., | [[http://im.ntu.edu.tw/~tsay/|Yih-Kuen Tsay (蔡益坤)]], NTU IM Dept., | ||
| Line 17: | Line 39: | ||
| =====TA===== | =====TA===== | ||
| + | Yi-Fan Lin (林奕帆), ''Xb08705009@ntu.edu.twX'' (between the enclosing pair of X's). | ||
| - | TBA | ||
| =====Textbook===== | =====Textbook===== | ||
| *//[[http://www.amazon.com/Introduction-Theory-Computation-Michael-Sipser/dp/113318779X|Introduction to the Theory of Computation, 3rd Edition]]//, Michael Sipser, Cengage Learning, 2012. (歐亞圖書代理) | *//[[http://www.amazon.com/Introduction-Theory-Computation-Michael-Sipser/dp/113318779X|Introduction to the Theory of Computation, 3rd Edition]]//, Michael Sipser, Cengage Learning, 2012. (歐亞圖書代理) | ||
| Line 30: | Line 52: | ||
| 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/21, 04/11, 05/09, and 05/30.) | are four TA sessions on 03/21, 04/11, 05/09, and 05/30.) | ||
| - | *Introduction and Mathematical Preliminaries (1.5 weeks: 02/21, 03/07a) [{{courses:theory2022:ch0_notes.pdf|notes}}, {{courses:theory2022:ch0_slides.pdf|slides}}] | + | *Introduction and Mathematical Preliminaries (1.5 weeks: 02/21, 03/07a) [{{courses:theory2023:ch0_notes.pdf|notes}}, {{courses:theory2023:ch0_slides.pdf|slides}}] |
| - | *Finite Automata and Regular Languages (2.5 weeks: 03/07b, 03/014, 03/21*) [{{courses:theory2022:ch1_notes.pdf|notes}}, {{courses:theory2022:ch1_slides.pdf|slides}}, appendix:{{courses:theory2022:ch1_minimization.pdf|minimization}}] | + | *Finite Automata and Regular Languages (2.5 weeks: 03/07b, 03/014, 03/21*) [{{courses:theory2023:ch1_notes.pdf|notes}}, {{courses:theory2023:ch1_slides.pdf|slides}}, appendix:{{courses:theory2023:ch1_minimization.pdf|minimization}}] |
| - | *Context-Free Languages and Pushdown Automata (2 weeks: 03/28, 04/11*) [{{courses:theory2022:ch2_notes.pdf|notes}},{{courses:theory2022:ch2_slides.pdf|slides}}] | + | *Context-Free Languages and Pushdown Automata (2 weeks: 03/28, 04/11*) [{{courses:theory2023:ch2_notes.pdf|notes}},{{courses:theory2023:ch2_slides.pdf|slides}}] |
| * **Midterm** (**2023/04/18**) | * **Midterm** (**2023/04/18**) | ||
| - | *Turing Machines (1.5 weeks: 04/25, 05/2a) [{{courses:theory2022:ch3_notes.pdf|notes}}, {{courses:theory2022:ch3_slides.pdf|slides}}] | + | *Turing Machines (1.5 weeks: 04/25, 05/2a) [{{courses:theory2023:ch3_notes.pdf|notes}}, {{courses:theory2023:ch3_slides.pdf|slides}}] |
| - | *Decidability (and Undecidability) (1.5 weeks: 05/02b, 05/09*) [{{courses:theory2022:ch4_notes.pdf|notes}}, {{courses:theory2022:ch4_slides.pdf|slides}}] | + | *Decidability (and Undecidability) (1.5 weeks: 05/02b, 05/09*) [{{courses:theory2023:ch4_notes.pdf|notes}}, {{courses:theory2023:ch4_slides.pdf|slides}}] |
| - | *Reducibility (1.5 weeks: 05/16, 05/23a) [{{courses:theory2022:ch5_notes.pdf|notes}}, {{courses:theory2022:ch5_slides.pdf|slides}}] | + | *Reducibility (1.5 weeks: 05/16, 05/23a) [{{courses:theory2023:ch5_notes.pdf|notes}}, {{courses:theory2023:ch5_slides.pdf|slides}}] |
| - | *Time Complexity and NP-Completeness (1.5 weeks: 05/23b, 05/30*) [{{courses:theory2022:ch7a_notes.pdf|notes}}, {{courses:theory2022:ch7a_slides.pdf|slides}}] | + | *Time Complexity and NP-Completeness (1.5 weeks: 05/23b, 05/30*) [{{courses:theory2023:ch7a_notes.pdf|notes}}, {{courses:theory2023:ch7a_slides.pdf|slides}}] |
| * **Final** (**2023/06/06**) | * **Final** (**2023/06/06**) | ||
courses/theory2023/main.1673269521.txt.gz · Last modified: 2023/01/09 21:05 by tsay2
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
