| |
| Peter Linz 在威斯康星大学获得博士学位，是加州大学戴维斯分校计算机科学系退休教授，其研究领域为计算机数值分析理论。除本书外，他还撰有《Exploring Numerical Methods:Fan Introduction to Scientific Computing》一书。
|
| Chapter 1 Introduction to the Theory of Computation 1.1 Mathematical Preliminaries and Notation 1.2 Three Basic Concepts 1.3 Some Applications Chapter 2 Finite Automata 2.1 Deterministic Finite Accepters 2.2 Nondeterministic Finite Accepter 2.3 Equivalence of deterministic and Nondeterminsitic Finite Accepters 2.4 Reduction of the Number of States in Finite Automata Chapter 3 Regular Languages and Regular Grammars 3.1 Regular Expressions 3.2 Connection Between Regular Expressions and Regular Languages 3.3 Regular Grammars Chapter 4 Properties of Regular Languages 4.1 Closure puoperties of Regular Languages 4.2 Elementary Questions about Regular Languages 4.3Identifying Nonregular Languages Chapter 5 Context-Free Languages Chapter 6 Simplification of Context-Free Grammars Chapter 7 Pushdown Automata Chapter 8 Puoperties of Context-Free Languages Chapter 9 Turing Machines Chapter 10 Other Models of Turing Machines Chapter 11 A Hierarchy of Formal Languages and Automata Chapter 12 Limits of Algorithmic Computation Chapter 13 Other Models of Computation Chapter 14 An Introduction to Computational Complexity Answers to Selected Exercises References Index |
内容加载中，请稍后...
商品评论（0条）