出版時(shí)間:2007-9 出版社:機(jī)械工業(yè) 作者:John E. Hopcroft,Rajeev Motwani,Jeffrey D. Ullman 頁(yè)數(shù):535
Tag標(biāo)簽:無
內(nèi)容概要
本書是關(guān)于形式語(yǔ)言、自動(dòng)機(jī)理論和計(jì)算復(fù)雜性方面的經(jīng)典教材,是三位理論計(jì)算大師的巔峰之作,現(xiàn)已更新到第3版。書中涵蓋了有窮自動(dòng)機(jī)、正則表達(dá)式與語(yǔ)言、正則語(yǔ)言的性質(zhì)、上下文無關(guān)文法及上下文無關(guān)語(yǔ)言、下推自動(dòng)機(jī)、上下文無關(guān)語(yǔ)言的,陸質(zhì)、圖靈機(jī)、不可判定性以及難解問題等內(nèi)容。 本書已被世界許多著名大學(xué)采用為計(jì)算機(jī)理論課程的教材或教學(xué)參考書,適合用作國(guó)內(nèi)高校計(jì)算機(jī)專業(yè)高年級(jí)本科生或研究生的教材,還可供從事理論計(jì)算工作的研究人員參考。
作者簡(jiǎn)介
John E.Hopcroft 于斯坦福大學(xué)獲得博士學(xué)位,現(xiàn)為康奈爾大學(xué)計(jì)算機(jī)科學(xué)系教授。1994年到2001年,任康奈爾大學(xué)工程學(xué)院院長(zhǎng)。他是1986年圖靈獎(jiǎng)獲得者。他的研究興趣集中在計(jì)算理論方面,尤其是算法分析、自動(dòng)機(jī)理論等。
書籍目錄
1 Automata: The Methods and the Madness 1.1 Why Study Automata Theory? 1.1.1 Introduction to Finite Automata 1.1.2 Structural Representations 1.1.3 Automata and Complexity 1.2 Introduction to Formal Proof 1.2.1 Deductive Proofs 1.2.2 Reduction to Definitions 1.2.3 Other Theorem Forms 1.2.4 Theorems That Appear Not to Be If-Then Statements 1.3 Additional Forms of Proof 1.3.1 Proving Equivalences About Sets 1.3.2 The Contrapositive 1.3.3 Proof by Contradiction 1.3.4 Counterexamples 1.4 Inductive Proofs 1.4.1 Inductions on Integers 1.4.2 More General Forms of Integer Inductions 1.4.3 Structural Inductions 1.4.4 Mutual Inductions 1.5 The Central Concepts of Automata Theory 1.5.1 Alphabets 1.5.2 , Strings 1.5.3 Languages 1.5.4 Problems 1.6 Summary of Chapter 1 1.7 Gradiance Problems for Chapter 1 1.8 References for Chapter 12 Finite Automata 2.1 An Informal Picture of Finite Automata 2.1.1 The Ground Rules 2.1.2 The Protocol 2.1.3 Enabling the Automata to Ignore Actions 2.1.4 The Entire System as an Automaton 2.1.5 Using the Product Automaton to Validate the Protocol 2.2 Deterministic Finite Automata 2.2.1 Definition of a Deterministic Finite Automaton 2.2.2 How a DFA Processes Strings 2.2.3 Simpler Notations for DFA's 2.2.4 Extending the Transition Function to Strings 2.2.5 The Language of a DFA 2.2.6 Exercises for Section 2.2 2.3 Nondeterministic Finite Automata 2.3.1 An Informal View of Nondeterministic Finite Automata 2.3.2 Definition of Nondeterministic Finite Automata 2.3.3 The Extended Transition Function 2.3.4 The Language of an NFA 2.3.5 Equivalence of Deterministic and Nondeterministic Finite Automata 2.3.6 A Bad Case for the Subset Construction 2.3.7 Exercises for Section 2.3 2.4 An Application: Text Search 2.4.1 Finding Strings in Text 2.4.2 Nondeterministic Finite Automata for Text Search 2.4.3 A DFA to Recognize a Set of Keywords 2.4.4 Exercises for Section 2.4 2.5 Finite Automata With Epsilon-Transitions 2.5.1 Uses of e-Transitions 2.5.2 The Formal Notation for an c-NFA 2.5.3 Epsilon-Closures 2.5.4 Extended Transitions and Languages for c-NFA's 2.5.5 Eliminating e-Transitions 2.5.6 Exercises for Section 2.5 2.6 Summary of Chapter 2 2.7 Gradiance Problems for Chapter 2 2.8 References for Chapter 23 Regular Expressions and Languages 3.1 Regular Expressions 3.1.1 The Operators of Regular Expressions 3.1.2 Building Regular Expressions 3.1.3 Precedence of Regular-Expression Operators 3.1.4 Exercises for Section 3.1 3.2 Finite Automata and Regular Expressions 3.2.1 From DFA's to Regular Expressions 3.2.2 Converting DFA's to Regular Expressions by Eliminating States……4 Properties kf Regular Languages5 Context-Free Grammars and Languages6 Pushdown Automata7 Properties of Context-Free Languages8 Introduction to Turing Machines9 Undecidability10 Intractable Problems11 Additional Classes of ProblemsIndex
圖書封面
圖書標(biāo)簽Tags
無
評(píng)論、評(píng)分、閱讀與下載
自動(dòng)機(jī)理論、語(yǔ)言和計(jì)算導(dǎo)論(英文版.第3版) PDF格式下載