TY  - BOOK
AU  - Sipser,Michael
TI  - Introduction to the theory of computation
SN  - 9781133187790
U1  - 511.35 
PY  - 2013///
CY  - Boston, USA
PB  - Cengage Learning
KW  - Teoría de las máquinas
KW  - Complejidad computacional
N1  - Includes bibliographical references and index; 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
UR  - https://itmsp.museknowledge.com/UOH?qurl=https://libros-uoh.uoh.cl/ESCUELADEINGENIERIA/INGENIERIA%2520CIVIL%2520EN%2520COMPUTACION/Introduction-to-the-Theory-of-Computation
ER  -