BOOK
Introduction to Automata Theory, Languages, and Computation: Pearson New International Edition
John E. Hopcroft | Rajeev Motwani | Jeffrey D. Ullman
(2013)
Additional Information
Book Details
Abstract
This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications. This new edition comes with Gradiance, an online assessment tool developed for computer science.
Please note, Gradiance is no longer available with this book, as we no longer support this product.
Table of Contents
| Section Title | Page | Action | Price |
|---|---|---|---|
| Cover | Cover | ||
| Table of Contents | i | ||
| Chapter 1. Automata: The Methods and the Madness | 1 | ||
| Chapter 2. Finite Automata | 37 | ||
| Chapter 3. Regular Expressions and Languages | 85 | ||
| Chapter 4. Properties of Regular Languages | 127 | ||
| Chapter 5. Context-Free Grammars and Languages | 171 | ||
| Chapter 6. Pushdown Automata | 225 | ||
| Chapter 7. Properties of Context-Free Languages | 261 | ||
| Chapter 8. Introduction to Turing Machines | 315 | ||
| Chapter 9. Undecidability | 377 | ||
| Chapter 10. Intractable Problems | 425 | ||
| Index | 483 | ||
| A | 483 | ||
| B | 483 | ||
| C | 484 | ||
| D | 484 | ||
| E | 485 | ||
| F | 485 | ||
| G | 485 | ||
| H | 485 | ||
| I | 485 | ||
| J | 485 | ||
| K | 485 | ||
| L | 485 | ||
| M | 486 | ||
| N | 486 | ||
| O | 486 | ||
| P | 486 | ||
| Q | 486 | ||
| R | 486 | ||
| S | 487 | ||
| T | 487 | ||
| U | 487 | ||
| V | 487 | ||
| W | 488 | ||
| X | 488 | ||
| Y | 488 | ||
| Z | 488 |