Martin, John C. <br/><br/>
Introduction to languages and the theory of computation / 
John C. Martin. 
 - 3rd ed. 
 - Boston :  McGraw-Hill,  c2003. 
 - xiii, 543 p. :  ill. ;  24 cm. 
<br/><br/>Includes bibliographical references (p. 529-530) and indexes. 
<br/><br/> Mathematical Notation and Techniques --   Basic Mathematical Objects --   Mathematical Induction and Recursive Definitions --   Regular Languages and Finite Automata --   Regular Expressions and Finite Automata --   Nondeterminism and Kleene's Theorem --   Regular and Nonregular Languages --   Context-Free Languages and Pushdown Automata --   Context-Free Grammars --   Pushdown Automata --   Context-Free and Non-Context-Free Languages --   Turing Machines and Their Languages --   Turing Machines --   Recursively Enumerable Languages --   Unsolvable Problems and Computable Functions --   Unsolvable Problems --   Computable Functions --   Introduction to Computational Complexity --   Measuring and Classifying Complexity --   Tractable and Intractable Problems.  Pt. I.  Ch. 1.  Ch. 2.  Pt. II.  Ch. 3.  Ch. 4.  Ch. 5.  Pt. III.  Ch. 6.  Ch. 7.  Ch. 8.  Pt. IV.  Ch. 9.  Ch. 10.  Pt. V.  Ch. 11.  Ch. 12.  Pt. VI.  Ch. 13.  Ch. 14. 
<br/><br/><label>ISBN: </label>0072322004 (alk. paper) 0071198547 (International ed. : alk. paper) 
<br/><br/><label>LCCN: </label>2002070865 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Sequential machine theory.<br/>Computable functions.
<br/><br/><label>LC Class. No.: </label>QA267.5.S4  / M29 2003 
<br/><br/><label>Dewey Class. No.: </label>511.3