Sipser, Michael. <br/><br/>
Introduction to the theory of computation / 
Michael Sipser. 
 - 2nd ed., Int ed. 
 - Boston, Mass. :  Thomson/Course Technology,  c2006. 
 - xvii, 437 p. :  ill. ;  24 cm. 
<br/><br/>Includes bibliographical references (p. 421-425) and index. 
<br/><br/>Part One: Automato and languages: 1. Regular languages - 2. Context-free languages -- Part two: Computability theory: 3. The church-turing thesis - 4. Decidability - 5. Reducibility - 6. Advanced topics in computability theory -- Part three: Complexity theory: 7. Time complexity - 8. Space Complexity - 9. Intractability - 10. Advanced topics in complexity theory. 
<br/><br/><label>ISBN: </label>0619217642 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Machine theory.<br/>Computational complexity.
<br/><br/><label>Dewey Class. No.: </label>511.3  / SIP