Sipser, Michael <br/><br/>
Introduction to the theory of computation / 
Michael Sipser 
 - Third edition 
 - Boston, USA :  Cengage Learning,  2013 
 - xxii, 458 pages :  illustrations. 
<br/><br/>Includes bibliographical references and index. 
<br/><br/>Introduction -- 0.1 Automata, Computability, and Complexity -- 0.2 Mathematical Notions and Terminology -- 0.3 Definitions, Theorems, and Proofs -- 0.4 Types of Proof -- Exercises -- Problems -- Selected Solutions -- Automata and Languages -- 1: Regular Languages -- 2: Context-Free Languages -- Computability Theory -- The Church–Turing Thesis -- Decidability -- Reducibility -- 6: Advanced Topics in Computability Theory -- Complexity Theory -- 7: Time Complexity -- 8: Space Complexity -- 9: Intractability -- 10: Advanced Topics in Complexity Theory. 
<br/><br/><label>ISBN: </label>9781133187790 9788131525296 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Teoría de las máquinas<br/>Complejidad computacional
<br/><br/><label>Dewey Class. No.: </label>511.35