Sipser, Michael. <br/><br/>
Introduction to the theory of computation / 
Michael Sipser. 
 - 2nd ed., international ed. 
 - Boston :  Thomson Course Technology,  c2006. 
 - xvii, 437 p. :  ill. ;  25 cm. 
<br/><br/> "The content of this text differs from the US version" -- back cover. 
<br/><br/>Includes bibliographical references 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>9780619217648 0619217642 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Machine theory.<br/>Computational complexity.
<br/><br/><label>LC Class. No.: </label>QA267  / .S56 2006