Introduction to the Theory of Computation

Fall 2016

Course Description:

This course introduces students to three traditionally central areas of the theory of computation: automata, computability, and complexity. The major topics covered in the course are finite automata, regular languages, context-free languages, pushdown automata, Turing machines, decidable problems, undecidable problems, the class P, the class NP, space complexity etc.

InstructorYuxin Deng
Office Room B1115, Science Building
Office
Hour
10am - 2pm, Monday - Friday
Phone 021-62231281
E-mail yxdeng(AT)sei.ecnu.edu.cn
Homepage basics.sjtu.edu.cn/~yuxin/

Reading Materials



Topics:



Grades:



Back