Sipser, Michael. <br/><br/>
Introduction to the theory of computation /  
Michael Sipser. 
 - 2nd ed. 
 - Boston :    Thomson Course Technology,   2006. 
 - xix, 431 p. :    ill. ;    25 cm. 
<br/><br/>Includes bibliographical references (p. 415-419) and index. 
<br/><br/>Introduction Part 1: Automata and Languages 1. Regular Languages 2. Context-Free Languages Part 2: Computability Theory 3. The Church-Turing Thesis 4. Decidability 5. Reducibility 6. Advanced Topics in Computability Theory Part 3: Complexity Theory 7. Time Complexity 8. Space Complexity 9. Intractability 10. Advanced Topics in Complexity Theory Selected Bibliography 
<br/><br/> This market leading text on computational theory provides a mathematical treatment of computer science theory designed around theorems and proofs. 
<br/><br/><label>ISBN: </label>0534950973 9780619217648 
<br/><br/><label>LCCN: </label>2006271030 
<br/><br/><label>Subjects--Uniform Titles: </label><br/>Bioinformatics.
<br/><br/><label>Subjects--Topical Terms: </label><br/>Machine theory.<br/>Computational complexity.
<br/><br/><label>Dewey Class. No.: </label>511.35