计算理论基础_Introduction总结.pptVIP

Kinds of Automata 第二章: Finite Automata Kinds of Automata 第三章: Context-free Languages （Pushdown Automata） Kinds of Automata 第四章: Turing Machines Turing Machines are formal version of algorithms: In other words No computable procedure will be considered an algorithm unless it can be presented as a Turing Machine 乔姆斯基（ Chomsky ）对语言的分类 第五章 Undecidability 第六章 第七章Computational ComplexityNP-completeness Elements of the Theory of Computation Introduction Textbook Elements of the Theory of Computation (Harry R. Lewis/ Christos H. Papadimitriou) Why this Course Automata (第二章：Finite-state Machi