1 Introduction to the Theory of Computation
2 Finite Automata
3 Regular Languages and Grammars
4 Properties of Regular Languages
5 Context-Free Languages
6 Simplification of Context-Free Grammars and Normal Forms
7 Pushdown Automata
8 Properties of Context-Free Languages
9 Turing Machines
10 Other Models of Turing Machines
11 A Hierarchy of Formal Languages and Automata
12 Limits of Algorithmic Computation
13 Other Models of Computation
14 An Overview of Computational Complexity
Peter Linz
Peter Linz, Professor Emeritus, University of California, DavisPeter Linz is Professor Emeritus in the Department of Computer Science at the University of California, Davis.Linz received his Ph.D. from the University of Wisconsin.Professor Linz's research emphasizes the development of a theory of numerical analysis that can be used in the construction of reliable numerical methods used in the design of problem-solving environments for scientific computing.Linz has released the seventh edition of An Introduction to Formal Languages and Automata, as well as Exploring Numerical Methods: An Introduction to Scientific Computing.
