Automata Theory, Introduction to Languages and Computation

Author: Hopcroft
Publisher:
Publish Date: 2004-06-01
Features: This book is a classic work on formal languages, automata theory, and computational complexity. It covers finite automata, regular expressions and languages, properties of regular languages, context-free grammars and context-free languages, pushdown automata, properties of context-free languages, Turing machines, undecidability, and hard problems. The book uses many details and intuitive explanations in its definitions and proofs, employs diagrams to clarify concepts, and includes a large number of examples and exercises of varying difficulty to help readers confirm and deepen their understanding of the content. This book is suitable as a textbook and teaching reference for senior undergraduate and graduate students in computer science majoring in computational theory courses.