語言與機(jī)器

內(nèi)容概要

　　《語言與機(jī)器：計(jì)算機(jī)科學(xué)理論導(dǎo)論（第3版）（影印版）》介紹了計(jì)算機(jī)科學(xué)的基礎(chǔ)知識，以及各種算法計(jì)算的能力和局限性?！墩Z言與機(jī)器：計(jì)算機(jī)科學(xué)理論導(dǎo)論（第3版）（影印版）》通過大量示例，以一種直觀、易懂的方式闡釋了計(jì)算機(jī)科學(xué)理論的概念及相關(guān)數(shù)學(xué)知識。第3版還擴(kuò)展介紹了自動機(jī)理論、計(jì)算理論和計(jì)算復(fù)雜性等內(nèi)容?！　墩Z言與機(jī)器：計(jì)算機(jī)科學(xué)理論導(dǎo)論（第3版）（影印版）》可作為計(jì)算機(jī)及相關(guān)專業(yè)的計(jì)算機(jī)科學(xué)理論課程的教材。

書籍目錄

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

圖書封面

圖書標(biāo)簽Tags

無

評論、評分、閱讀與下載

---

    語言與機(jī)器 PDF格式下載

---