Sipser, Michael <br/><br/>
Introduction to the theory of computation 
	Michael Sipser 
 - 3RD 
 - Australia :   Cengage Learning,  ©2013 
 - 458P: 
<br/><br/> 1. Regular Languages.   2. Context-Free Languages.   3. The Church-Turing Thesis.   4. Decidability.   5. Reducibility.   6. Advanced Topics in Computability Theory.  7. Time Complexity.   8. Space Complexity.   9. Intractability.   10. Advanced Topics in Complexity Theory 
<br/><br/> Michael Sipser's emphasis on unifying computer science theory - rather than offering a collection of low-level details - sets the book apart, as do his intuitive explanations. Throughout the book, Sipser builds students' knowledge of conceptual tools used in computer science, the aesthetic sense they need to create elegant systems, and the ability to think through problems on their own 
<br/><br/><label>ISBN: </label>9788131525296 
<br/><br/><label>Dewey Class. No.: </label>511.35  / SIP