TY  - BOOK
AU  - Hopcroft, John E.
AU  - Motwani, Rajeev 
AU  - Ullman, Jeffrey D. 
TI  - Introduction to automata theory, languages, and computation
SN  - 978-0201441246
AV  - QA 267 .H67 2001 
PY  - 2001///
CY  - Boston
PB  - Addison-Wesley
KW  - MACHINE THEORY
KW  - FORMAL LANGUAGES
KW  - COMPUTATIONAL COMPLEXITY
N1  - Includes bibliographical references (pages 510-511) and index; Automata: The Methods and the Madness -- Finite Automata -- Regular Expressions and Languages -- Properties of Regular Languages -- Context-Free Grammars and Languages -- Pushdown Automata -- Properties of Context-Free Languages
N2  - It has been more than 20 years since this classic book on formal languages, automata theory, and computational complexity was first published. With this long-awaited revision, the authors continue to present the theory in a concise and straightforward manner, now with an eye out for the practical applications. They have revised this book to make it more accessible to today's students, including the addition of more material on writing proofs, more figures and pictures to convey ideas, side-boxes to highlight other interesting material, and a less formal writing style. Exercises at the end of each chapter, including some new, easier exercises, help readers confirm and enhance their understanding of the material
ER  -