The goal of this course is to acquaint the students with the basic concepts in computation theory and to cultivate the students' ability in analyzing the complexity of computational problems.

• 07/04: grade report available; please send inquiries, if any, to the instructor by 2PM 07/05.
• 06/18: slides from TA sessions: HW#6-7, HW#8-10.
• 05/31: HW#10 due on 06/07.
• 05/24: HW#9 due on 05/31.
• 05/24: notes/slides for Time Complexity and NP-Completeness available.
• 05/18: Suggested Solutions to Midterm Problems available (revised on 5/24, 6/25, and 2018/04/25).
• 05/17: notes/slides for Reducibility available.
• 05/10: HW#8 due on 05/24.
• 05/10: notes/slides for Decidability available.
• 05/03: HW#7 due on 05/10.
• 04/20: slides from TA sessions: HW#1-2, HW#3-5.
• 04/19: old exams: 2000-2016.
• 04/19: notes/slides for Turing Machines available.
• 04/12: HW#6 due on 04/26.
• 03/29: HW#5 due on 04/12.
• 03/22: notes/slides for Context-Free Languages and Pushdown Automata available.
• 03/22: HW#4 due on 03/29.
• 03/15: HW#3 due on 03/22.
• 03/08: HW#2 due on 03/15.
• 03/01: notes/slides for Finite Automata and Regular Languages available.
• 03/01: HW#1 due on 03/08.
• 02/22: notes/slides for Introduction and Mathematical Preliminaries available.
• 02/20: this website announced.

Yih-Kuen Tsay (蔡益坤), NTU IM Dept., 3366-1189, Xtsay@ntu.edu.twX (between the enclosing pair of X's).

Wednesday 2:20~5:20PM, Room 102 (Room 304 from 5/17), Management Building 2.
TA sessions will be scheduled prior to some of the class meetings between 1:20 and 2:10PM; see the course schedule.

Tuesday 1:30~2:00PM, Wednesday 1:30~2:00PM, or by appointment, Room 1108, Management Building 2.

Willy Chang (張子建), 3366-1205, Xr03725007@ntu.edu.twX (between the enclosing pair of X's).

• Introduction to the Theory of Computation, 3rd Edition, Michael Sipser, Cengage Learning, 2012. (歐亞圖書代理)

This is an introductory course to the theory of computation. It covers various mathematical models, including automata and Turing machines, for physical computing machineries along with their computational capabilities/limitations. In terms of specific topics and the order of their exposition, the course will follow closely the book by Sipser.
(Note: a TA session will precede a class meeting whose date is marked with an *. There are four TA sessions on 3/22, 4/12, 5/10, and 6/7.)

• Introduction and Mathematical Preliminaries (2 weeks: 2/22, 3/1) [notes, slides]
• Finite Automata and Regular Languages (3 weeks: 3/8, 3/15, 3/22*) [notes, slides, appendix:minimization]
• Context-Free Languages and Pushdown Automata (2 weeks: 3/29, 4/12*) [notes,slides]
• Turing Machines (2 weeks: 4/19, 5/3) [notes, slides]
• Midterm (2017/04/26)
• Decidability (and Undecidability) (1 week: 5/10*) [notes, slides]
• Reducibility (2 weeks: 5/17, 5/24) [notes, slides]
• Time Complexity and NP-Completeness (3 weeks: 5/31, 6/7*, 6/14) [notes, slides]
• Final (2017/06/21)

• MIT OpenCourseWare: Automata, Computability, and Complexity
• Stanford Coursera: Automata
• Introduction to Automata Theory, Languages, and Computation, John E. Hopcroft and Jeffrey D. Ullman, Addison-Wesley, 1979.
• Introduction to Automata Theory, Languages, and Computation, 3rd Edition, John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman, Addison-Wesley, 2006.
• Elements of the Theory of Computation, 2nd Edition, Harry R. Lewis and Christos H. Papadimitriou, Prentice-Hall, 1998.
• Maillardet's Automaton at the Franklin Institute.
• What Is an Algorithm? (M.Y. Vardi, Communications of the ACM, Volume 55 Issue 3, March 2012)
• What Is Computation? (a lecture by Leslie Lamport, who received the 2013 Turing Award)
• Free Tool: GOAL
• Free Tool: JFLAP

Homework 20%, Participation 10%, Midterm 35%, Final 35%.