|
|
|
This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the model's rich and varied structure. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in analyses of effective computability, decidability, and Godel's incompleteness theorems. Students who already have some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts.
| ISBN | 0387949070 | | Volumes | 1 | | ISBN13 | 9780387949079
(What's this?) | | Weight (grammes) | 949 | | Publisher | Springer-Verlag New York Inc. | | Published in | New York, NY | | Imprint | Springer-Verlag New York Inc. | | Series editor | Gries, D., Gries, D., Gries, D. | | Format | Hardback | | Series title | Undergraduate Texts in Computer Science | | Publication date | 30 Jun 1997 | | Height (mm) | 254 | | Library of Congress | 96-37409 | | Width (mm) | 178 | | DEWEY | 006.31 | | Spine width (mm) | 23 | | DEWEY edition | DC21 | | Academic level | Undergraduate | | Pages | 413 | |
|
| |
| | | Preface | | | | | | Lectures | | 1 | | 1 | | Course Roadmap and Historical Perspective | | 3 | | 2 | | Strings and Sets | | 7 | | 3 | | Finite Automata and Regular Sets | | 14 | | 4 | | More on Regular Sets | | 19 | | 5 | | Nondeterministic Finite Automata | | 25 | | 6 | | The Subset Construction | | 32 | | 7 | | Pattern Matching | | 40 | | 8 | | Pattern Matching and Regular Expressions | | 44 | | 9 | | Regular Expressions and Finite Automata | | 49 | | A | | Kleene Algebra and Regular Expressions | | 55 | | 10 | | Homomorphisms | | 61 | | 11 | | Limitations of Finite Automata | | 67 | | 12 | | Using the Pumping Lemma | | 72 | | 13 | | DFA State Minimization | | 77 | | 14 | | A Minimization Algorithm | | 84 | | 15 | | Myhill-Nerode Relations | | 89 | | 16 | | The Myhill-Nerode Theorem | | 95 | | B | | Collapsing Nondeterministic Automata | | 100 | | C | | Automata on Terms | | 108 | | D | | The Myhill-Nerode Theorem for Term Automata | | 114 | | 17 | | Two-Way Finite Automata | | 119 | | 18 | | 2DFAs and Regular Sets | | 124 | | 19 | | Context-Free Grammars and Languages | | 129 | | 20 | | Balanced Parentheses | | 135 | | 21 | | Normal Forms | | 140 | | 22 | | The Pumping Lemma for CFLs | | 148 | | | More... | | |
|
|
|
|
|
Enlarge
Google Books: