图书介绍
计算机理论基础 影印版PDF|Epub|txt|kindle电子书版本网盘下载
- Harry R.Lewis，Christos H.Papadimitriou 著
- 出版社： 北京：清华大学出版社
- ISBN：7302036233
- 出版时间：1999
- 标注页数：361页
- 文件大小：14MB
- 文件页数：373页
- 主题词：暂缺
PDF下载
下载说明
计算机理论基础 影印版PDF格式电子书版下载
下载的文件为RAR压缩包。需要使用解压软件进行解压得到PDF格式图书。建议使用BT下载工具Free Download Manager进行下载,简称FDM(免费,没有广告,支持多平台）。本站资源全部打包为BT种子。所以需要使用专业的BT下载软件进行下载。如BitComet qBittorrent uTorrent等BT下载工具。迅雷目前由于本站不是热门资源。不推荐使用！后期资源热门了。安装了迅雷也可以迅雷进行下载！
（文件页数 要大于 标注页数，上中下等多册电子书除外）
注意：本站所有压缩包均有解压码： 点击下载压缩包解压工具
图书目录
Introduction1
1 Sets,Relations,and Languages5
1.1 Sets5
1.2 Relations and functions9
1.3 Special types of binary relations13
1.4 Finite and infinite sets20
1.5 Three fundamental proof techniques23
1.6 Closures and algorithms30
1.7 Alphabets and languages42
1.8 Finite representations of languages47
References52
2 Finite Automata55
2.1 Deterministic finite automata55
2.2 Nondeterministic finite automata63
2.3 Finite automata and regular expressions75
2.4 Languages that are and are not regular86
2.5 State minimization92
2.6 Algorithmic aspects of finite automata102
References110
3 Context-free Languages113
3.1 Context-free grammars113
3.2 Parse trees122
3.3 Pushdown automata130
3.4 Pushdown automata and context-free grammars136
3.5 Languages that are and are not context-free143
3.6 Algorithms for context-free grammars150
3.7 Determinism and parsing158
References175
4.1 The definition of a Turing machine179
4 Turing machines179
4.2 Computing with Turing machines194
4.3 Extensions of Turing machines200
4.4 Random access Turing machines210
4.5 Nondeterministic Turing machines221
4.6 Grammars227
4.7 Numerical functions233
References243
5 Undecidability245
5.1 The Church-Turing thesis245
5.2 Universal Turing machines247
5.3 The halting problem251
5.4 Unsolvable problems about Turing machines254
5.5 Unsolvable problems about grammars258
5.6 An unsolvable tiling problem262
5.7 Properties of recursive languages267
References272
6 Computational Complexity275
6.1 The class P275
6.2 Problems,problems...278
6.3 Boolean satisfiability288
6.4 The class NP292
References299
7 NP-completeness301
7.1 Polynomial-time reductions301
7.2 Cook's Theorem309
7.3 More NP-complete problems317
7.4 Coping with NP-completeness333
References350
Index353