Hopcroft, John E. <br/><br/>
Introduction to automata theory, languages, and computation / 
John E. Hopcroft and Jeffrey D. Ullman. 
 - Massachusetts :  Addision-Wesley Publishing Company,  c1979 
 - x, 411 pages ;  21 cm. 
<br/><br/>Includes bibliographical references and index. 
<br/><br/>Chapter 1. Preliminaries -- Chapter 2. Finite automata and regular expressions -- Chapter 3. Properties of regular sets -- Chapter 4. Context-free grammar -- Chapter 5. Pushdown automata -- Chapter 6. Properties of context-free languages -- Chapter 7. Turing machines -- Chapter 8. Undecidability -- Chapter 9. The chomsky hierarchy -- Chapter 10. Deterministic context-free languages -- Chapter 11. Closure properties of families of languages -- Chapter 12. Computational complexity theory -- Chapter 13. Intractable problems -- Chapter 14. Highlights of other important language classes. 
<br/><br/> Ten years ago the authors undertook to produce a book converting the known material on formal languages, automata theory, and computational complexity. 
<br/><br/><label>ISBN: </label>9780201029888 
<br/><br/><label>Subjects--Topical Terms: </label><br/>MACHINE THEORY
<br/><br/><label>LC Class. No.: </label>QA 237 .H67 1979