Book:John E. Hopcroft/Introduction to Automata Theory, Languages, and Computation

Affectionately known as "The Cinderella Book".

Subject Matter

 * Computer Science

Contents

 * Preface


 * Chapter 1 Preliminaries
 * Chapter 2 Finite Automata and Regular Expressions
 * Chapter 3 Properties of Regular Sets
 * Chapter 4 Context-Free Grammars
 * Chapter 5 Pushdown Automata
 * Chapter 6 Properties of Context-Free Languages
 * Chapter 7 Turing Machines
 * Chapter 8 Undecidability
 * Chapter 9 The Chomsky Hierarhy
 * Chapter 10 Deterministic Context-Free Languages
 * Chapter 11 Closure Properties of Families of Languages
 * Chapter 12 Computational Complexity Theory
 * Chapter 13 Intractable Problems
 * Chapter 14 Highlights of Other Important Language Classes


 * Bibliography
 * Index

Also see
Introduction to Automata Theory, Languages, and Computation