- 作 者：Harry R.Lewis，Christos H.Papadimitriou
- 出 版 社：北京：清华大学出版社
- 出版年份：1999
- ISBN：7302036233
- 标注页数：361 页
- PDF页数：373 页
请阅读订购服务说明与试读!
订购服务说明
1、本站所有的书默认都是PDF格式，该格式图书只能阅读和打印，不能再次编辑。
2、除分上下册或者多册的情况下，一般PDF页数一定要大于标注页数才建议下单购买。【本资源373 ≥361页】
图书下载及付费说明
1、所有的电子图书为PDF格式，支持电脑、手机、平板等各类电子设备阅读；可以任意拷贝文件到不同的阅读设备里进行阅读。
2、电子图书在提交订单后一般半小时内处理完成,最晚48小时内处理完成。(非工作日购买会延迟)
3、所有的电子图书都是原书直接扫描方式制作而成。
Introduction 1
1 Sets,Relations,and Languages 5
1.1 Sets 5
1.2 Relations and functions 9
1.3 Special types of binary relations 13
1.4 Finite and infinite sets 20
1.5 Three fundamental proof techniques 23
1.6 Closures and algorithms 30
1.7 Alphabets and languages 42
1.8 Finite representations of languages 47
References 52
2 Finite Automata 55
2.1 Deterministic finite automata 55
2.2 Nondeterministic finite automata 63
2.3 Finite automata and regular expressions 75
2.4 Languages that are and are not regular 86
2.5 State minimization 92
2.6 Algorithmic aspects of finite automata 102
References 110
3 Context-free Languages 113
3.1 Context-free grammars 113
3.2 Parse trees 122
3.3 Pushdown automata 130
3.4 Pushdown automata and context-free grammars 136
3.5 Languages that are and are not context-free 143
3.6 Algorithms for context-free grammars 150
3.7 Determinism and parsing 158
References 175
4.1 The definition of a Turing machine 179
4 Turing machines 179
4.2 Computing with Turing machines 194
4.3 Extensions of Turing machines 200
4.4 Random access Turing machines 210
4.5 Nondeterministic Turing machines 221
4.6 Grammars 227
4.7 Numerical functions 233
References 243
5 Undecidability 245
5.1 The Church-Turing thesis 245
5.2 Universal Turing machines 247
5.3 The halting problem 251
5.4 Unsolvable problems about Turing machines 254
5.5 Unsolvable problems about grammars 258
5.6 An unsolvable tiling problem 262
5.7 Properties of recursive languages 267
References 272
6 Computational Complexity 275
6.1 The class P 275
6.2 Problems,problems... 278
6.3 Boolean satisfiability 288
6.4 The class NP 292
References 299
7 NP-completeness 301
7.1 Polynomial-time reductions 301
7.2 Cook's Theorem 309
7.3 More NP-complete problems 317
7.4 Coping with NP-completeness 333
References 350
Index 353