000			01701cam a2200433Ma 4500
001			u11320
003			SA-PMU
005			20210418124051.0
008			111120s2013 maua b 001 0 eng d
040			_aLVB _bfre _cLVB _dUTO _dOCLCO _dZWZ _dOCLCF _dRUQBL
020			_a9781133187790
020			_a113318779X
035			_a(OCoLC)811603126
050		4	_aQA267 _b.S56 2013
082	0	4	_a511.3 _220
100	1		_aSipser, Michael.
245	1	0	_aIntroduction to the theory of computation / _cMichael Sipser.
250			_a3rd ed.
260			_aBoston, MA : _bCengage Learning, _cc2013.
300			_axxii, 458 p. : _bill. ; _c24 cm.
504			_aBibliogr.: p. 443-447.
505	0	0	_g1. _tRegular languages -- _g2. _tContext-free languages -- _g3. _tThe Church-Turing thesis -- _g4. _tDecidability -- _g5. _tReducibility -- _g6. _tAdvanced topics in computability theory -- _g7. _tTime complexity -- _g8. _tSpace complexity -- _g9. _tInteractibility -- _g10. _tAdvanced topics in complexity theory.
650		6	_aThéorie des automates.
650		6	_aComplexité de calcul (Informatique)
650		0	_aMachine theory.
650		0	_aComputational complexity.
650		7	_aAutomates mathématiques, Théorie des. _2ram
650		7	_aComplexité de calcul (informatique). _2ram
650		7	_aInformatique _xModèles mathématiques. _2ram
650		7	_aTuring, Machines de. _2ram
650		7	_aDécidabilité (logique mathématique). _2ram
650		7	_aComputational complexity. _2fast _0(OCoLC)fst00871991
650		7	_aMachine theory. _2fast _0(OCoLC)fst01004846
029	1		_aZWZ _b167250892
942			_cBOOK
994			_aZ0 _bSUPMU
948			_hNO HOLDINGS IN SUPMU - 15 OTHER HOLDINGS
596			_a1
999			_c6033 _d6033