語言與機器:計算機科學理論導論(第3版)(簡體書)
商品資訊
ISBN13:9787302151722
出版社:清華大學出版社(大陸)
作者:影印
出版日:2007/07/01
裝訂/頁數:平裝/654頁
版次:1
人民幣定價:69 元
定價
:NT$ 414 元優惠價
:87 折 360 元
絕版無法訂購
商品簡介
目次
相關商品
商品簡介
本書介紹了計算機科學的基礎知識,以及各種算法計算的能力和局限性。本書通過大量示例,以一種直觀、易懂的方式闡釋了計算機科學理論的概念及相關數學知識。第3版還擴展介紹了自動機理論、計算理論和計算復雜性等內容。 本書可作為計算機及相關專業的計算機科學理論課程的教材。
目次
Pretace
IntroductiOn
PART I Foundations
Chapter 1 MathematicaI Preliminaries
1.1 SetTheory
1.2 Cartesian Product,Relations,and Functions
1.3 Equivalence Relations
1.4 Countable and Uncountable Sets
1.5 DiagonalizatiOn and Self-Reference
1.6 Recursive Definitions
1.7 Mathematical Induction
1.8 Directed Graphs
Exercises
Bibliographic Notes
Chapter 2 Languages
2.1 Strings and Languages
2.2 Finite Specification of Languages
2.3 Regular Sets and Expressions
2.4 Regular Expressions and Text Searching
Exercises
Bibliographic Notes
PART II Grammars,Automata,and Languages
Chapter 3 Context-Free Grammars
3.1 Context-Free Grammars and Languages
3.2 Examples of Grammars and Languages
3.3 Regular Grammars
3.4 Verifying Grammars
3.5 Leftmost Derivations and Ambiguity
3.6 Context-Free Grammars and Programming Language Definition
Exercises
Bibliographic Notes
Chapter 4 NormaI Forms for Context-Free Grammars
4.1 Grammar Transformations
4.2 Elimination ofλ-Rules
4.3 Elimination of Chin Rules
4.4 Useless Symbols
4.5 Chomsky Normal Form
4.6 The CYK Algorithm
4.7 Removal of Direct Left Recursion
4.8 Greibach Normal Form
Exercises
Bibliographic NOtes
Chapter 5 Finite AutGImata
5.1 A Finite.State Machine
5.2 Deterministic Finite AutOmata
5.3 State Diagrams and Examples
5.4 Nondeterministic Finite Automata
5.5 λ-Transitions
5.6 Removing Nondeterminism
5.7 DFA Minimization
Exercises
Bibliographic Notes
……
PART III Computability
PART IV Computational Complexity
PART V Deterministic Parsing
Appendix
Bibliography
Subject Index
IntroductiOn
PART I Foundations
Chapter 1 MathematicaI Preliminaries
1.1 SetTheory
1.2 Cartesian Product,Relations,and Functions
1.3 Equivalence Relations
1.4 Countable and Uncountable Sets
1.5 DiagonalizatiOn and Self-Reference
1.6 Recursive Definitions
1.7 Mathematical Induction
1.8 Directed Graphs
Exercises
Bibliographic Notes
Chapter 2 Languages
2.1 Strings and Languages
2.2 Finite Specification of Languages
2.3 Regular Sets and Expressions
2.4 Regular Expressions and Text Searching
Exercises
Bibliographic Notes
PART II Grammars,Automata,and Languages
Chapter 3 Context-Free Grammars
3.1 Context-Free Grammars and Languages
3.2 Examples of Grammars and Languages
3.3 Regular Grammars
3.4 Verifying Grammars
3.5 Leftmost Derivations and Ambiguity
3.6 Context-Free Grammars and Programming Language Definition
Exercises
Bibliographic Notes
Chapter 4 NormaI Forms for Context-Free Grammars
4.1 Grammar Transformations
4.2 Elimination ofλ-Rules
4.3 Elimination of Chin Rules
4.4 Useless Symbols
4.5 Chomsky Normal Form
4.6 The CYK Algorithm
4.7 Removal of Direct Left Recursion
4.8 Greibach Normal Form
Exercises
Bibliographic NOtes
Chapter 5 Finite AutGImata
5.1 A Finite.State Machine
5.2 Deterministic Finite AutOmata
5.3 State Diagrams and Examples
5.4 Nondeterministic Finite Automata
5.5 λ-Transitions
5.6 Removing Nondeterminism
5.7 DFA Minimization
Exercises
Bibliographic Notes
……
PART III Computability
PART IV Computational Complexity
PART V Deterministic Parsing
Appendix
Bibliography
Subject Index
主題書展
更多
主題書展
更多書展今日66折
您曾經瀏覽過的商品
購物須知
大陸出版品因裝訂品質及貨運條件與台灣出版品落差甚大,除封面破損、內頁脫落等較嚴重的狀態,其餘商品將正常出貨。
特別提醒:部分書籍附贈之內容(如音頻mp3或影片dvd等)已無實體光碟提供,需以QR CODE 連結至當地網站註冊“並通過驗證程序”,方可下載使用。
無現貨庫存之簡體書,將向海外調貨:
海外有庫存之書籍,等候約45個工作天;
海外無庫存之書籍,平均作業時間約60個工作天,然不保證確定可調到貨,尚請見諒。
為了保護您的權益,「三民網路書店」提供會員七日商品鑑賞期(收到商品為起始日)。
若要辦理退貨,請在商品鑑賞期內寄回,且商品必須是全新狀態與完整包裝(商品、附件、發票、隨貨贈品等)否則恕不接受退貨。