Introduction to Automata Theory, Languages, and Computation

A foundational text in theoretical computer science, this volume by Hopcroft, Motwani, and Ullman presents the core concepts of automata theory, formal languages, and computational complexity. The book is renowned for its clear, concise exposition and rigorous treatment of proof construction, making it a standard reference for understanding the mathematical underpinnings of computation. It covers finite automata, regular expressions, context-free grammars, Turing machines, and undecidability, bridging abstract theory with practical implications for programming language design and algorithm analysis.

Description adapted from Open Library ↗.