Introduction to Automata Theory, Languages, and Computation is an influential computer science textbook by John Hopcroft and Jeffrey Ullman on formal languages and the theory of computation. Rajeev Motwani contributed to the , and later, edition. Among experts also known as the Cinderella Book. This nickname is derived from a girl putatively Cinderella on the cover with a Rube Goldberg machine. The forerunner of this book appeared under the title Formal Languages and Their Relation to Automata in
|Published (Last):||24 February 2012|
|PDF File Size:||4.62 Mb|
|ePub File Size:||19.2 Mb|
|Price:||Free* [*Free Regsitration Required]|
Skip to search form Skip to main content You are currently offline. Some features of the site may not work correctly. DOI: Hopcroft and Jeffrey D. Hopcroft , Jeffrey D.
Ullman Published Computer Science. This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity. The authors present the theory in a concise and straightforward manner, with an eye out for the practical applications. Exercises at the end of each chapter, including some that have been solved, help readers confirm and enhance their understanding of the material. View via Publisher. Save to Library.
Create Alert. Launch Research Feed. Share This Paper. Supplemental Video. Introduction to Automata, Languages and Computation. IIT Kharagpur July Explore Further Discover more papers related to the topics discussed in this paper. Figures and Topics from this paper. Automata theory Formal language Model of computation Computer science Computational complexity theory Automaton. Citations Publications citing this paper. A practical turing machine representation Robert M.
Introduction to Automata Theory, Languages and Computation
Solutions to Selected Exercises