Sipser, Michael creator author text us Boston, USA Cengage Learning 2013 Third edition monographic eng xxii, 458 pages : illustrations. 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. specialized Michael Sipser Includes bibliographical references and index. Teoría de las máquinas Complejidad computacional 511.35 9781133187790 9788131525296 https://itmsp.museknowledge.com/UOH?qurl=https://libros-uoh.uoh.cl/ESCUELADEINGENIERIA/INGENIERIA%2520CIVIL%2520EN%2520COMPUTACION/Introduction-to-the-Theory-of-Computation https://itmsp.museknowledge.com/UOH?qurl=https://libros-uoh.uoh.cl/ESCUELADEINGENIERIA/INGENIERIA%2520CIVIL%2520EN%2520COMPUTACION/Introduction-to-the-Theory-of-Computation clrauoh 191128 20260331160220.0 u1751