Lewis, Harry R. <br/><br/>
Elements of the theory of computation / 
Harry R. Lewis, Christos H. Papadimitriou. 
 - 2nd ed. 
 - Upper Saddle River, N.J. :  Prentice-Hall,  c1998. 
 - 361 p. :  ill. ;  25 cm. 
<br/><br/>Includes bibliographical references and index. 
<br/><br/>1. Sets, Relations, and Languages. 2. Finite Automata. 3. Context-free Languages. 4. Turing Machines. 5. Undecidability. 6. Computational Complexity. 7. NP-completeness. Index. 
<br/><br/> Appropriate for senior and graduate level courses in Computer Science Theory, Automata, and Theory of Computation. This is the long awaited Second Edition of Lewis and Papadimitriou's best-selling theory of computation text. In this substantially modified edition, the authors have enhanced the clarity of their presentation by making the material more accessible to a broader undergraduate audience with no special mathematical experience. 
<br/><br/><label>ISBN: </label>0132624788 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Machine theory.<br/>Formal languages.<br/>Computational complexity.<br/>Logic, Symbolic and mathematical.
<br/><br/><label>LC Class. No.: </label>QA267  / .L49 1998