语言与机器

出版时间：2007-7  出版社：清华大学  作者：苏达坎  页数：654  
Tag标签：无  

内容概要

　　《语言与机器：计算机科学理论导论（第3版）（影印版）》介绍了计算机科学的基础知识，以及各种算法计算的能力和局限性。《语言与机器：计算机科学理论导论（第3版）（影印版）》通过大量示例，以一种直观、易懂的方式阐释了计算机科学理论的概念及相关数学知识。第3版还扩展介绍了自动机理论、计算理论和计算复杂性等内容。　《语言与机器：计算机科学理论导论（第3版）（影印版）》可作为计算机及相关专业的计算机科学理论课程的教材。

书籍目录

PretaceIntroductiOnPART I FoundationsChapter 1 MathematicaI Preliminaries1.1 SetTheory1.2 Cartesian Product，Relations，and Functions1.3 Equivalence Relations1.4 Countable and Uncountable Sets1.5 DiagonalizatiOn and Self-Reference1.6 Recursive Definitions1.7 Mathematical Induction1.8 Directed GraphsExercisesBibliographic NotesChapter 2　Languages2.1 Strings and Languages2.2 Finite Specification of Languages2.3 Regular Sets and Expressions2.4 Regular Expressions and Text SearchingExercisesBibliographic NotesPART II Grammars，Automata，and LanguagesChapter 3 Context-Free Grammars3.1 Context-Free Grammars and Languages3.2 Examples of Grammars and Languages3.3 Regular Grammars3.4 Verifying Grammars3.5 Leftmost Derivations and Ambiguity3.6 Context-Free Grammars and Programming Language DefinitionExercisesBibliographic NotesChapter 4 NormaI Forms for Context-Free Grammars4.1 Grammar Transformations4.2 Elimination ofλ-Rules4.3 Elimination of Chin Rules4.4 Useless Symbols4.5 Chomsky Normal Form4.6 The CYK Algorithm4.7 Removal of Direct Left Recursion4.8 Greibach Normal FormExercisesBibliographic NOtesChapter 5 Finite AutGImata5.1 A Finite.State Machine5.2 Deterministic Finite AutOmata5.3 State Diagrams and Examples5.4 Nondeterministic Finite Automata5.5 λ-Transitions5.6 Removing Nondeterminism5.7 DFA MinimizationExercisesBibliographic Notes……PART III ComputabilityPART IV Computational ComplexityPART V Deterministic ParsingAppendixBibliographySubject Index