000			01643nam a2200301 4500
001			u1751
003			SIRSI
005			20260331160220.0
008			191128t2013 us ad fr 001 0 eng d
020			_a9781133187790
020			_a9788131525296
040			_aclrauoh _cclrauoh _dclrauoh _erda
082			_a511.35
100	1		_aSipser, Michael _eauthor
245	1	0	_aIntroduction to the theory of computation / _cMichael Sipser
250			_aThird edition
260			_aBoston, USA : _bCengage Learning, _c2013
300			_axxii, 458 pages : _billustrations.
336			_atexto _btxt _2rdacontent
337			_aunmediated _bn _2rdamedia
338			_avolume _bnc _2rdacarrier
504			_aIncludes bibliographical references and index.
505			_aIntroduction -- 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.
650			_aTeoría de las máquinas
650			_aComplejidad computacional
856			_uhttps://itmsp.museknowledge.com/UOH?qurl=https://libros-uoh.uoh.cl/ESCUELADEINGENIERIA/INGENIERIA%2520CIVIL%2520EN%2520COMPUTACION/Introduction-to-the-Theory-of-Computation _yVER LIBRO DIGITAL BIBLIOGRAFÍA BÁSICA
942			_2ddc _cBOOK
999			_c685 _d685