形式語言與自動機導論

內容概要

本書精辟地闡述了計算課程的入門理論，簡明地解釋了復雜的思想并且提供了堅實的數(shù)學基礎知識。作者提供了直觀的證明，同時避免過多數(shù)學細節(jié)，這樣學生就能夠集中精力理解基本理論。許多精心選擇的例子在幾種上下文中重復出現(xiàn)，這樣學生就能夠通過對比式的研究加強理解。

作者簡介

Peter Linz 在威斯康星大學獲得博士學位，是加州大學戴維斯分校計算機科學系退休教授，其研究領域為計算機數(shù)值分析理論。除本書外，他還撰有《Exploring Numerical Methods:Fan Introduction to Scientific Computing》一書。

書籍目錄

Chapter 1 Introduction to the Theory of Computation   1.1 Mathematical Preliminaries and Notation  1.2 Three Basic Concepts  1.3 Some Applications Chapter 2 Finite Automata  2.1 Deterministic Finite Accepters  2.2 Nondeterministic Finite Accepter  2.3 Equivalence of deterministic and Nondeterminsitic Finite Accepters   2.4 Reduction of the Number of  States in Finite AutomataChapter 3 Regular Languages and Regular Grammars  3.1 Regular Expressions   3.2 Connection Between Regular Expressions and Regular Languages 3.3 Regular GrammarsChapter 4 Properties of Regular Languages  4.1 Closure puoperties of Regular Languages  4.2 Elementary Questions about Regular Languages  4.3Identifying Nonregular LanguagesChapter 5 Context-Free LanguagesChapter 6 Simplification of Context-Free GrammarsChapter 7 Pushdown AutomataChapter 8 Puoperties of Context-Free LanguagesChapter 9 Turing Machines Chapter 10 Other Models of Turing MachinesChapter 11 A Hierarchy of  Formal Languages and AutomataChapter 12 Limits of Algorithmic Computation Chapter 13 Other Models of ComputationChapter 14 An Introduction to Computational ComplexityAnswers to Selected ExercisesReferencesIndex

圖書封面

圖書標簽Tags

無

評論、評分、閱讀與下載

---

    形式語言與自動機導論 PDF格式下載

---