000			02048mam a22003374a 4500
001			3393027
003			OSt
005			20210930191620.0
008			020425s2003 maua b 001 0 eng
010			_a 2002070865
020			_a0072322004 (alk. paper)
020			_a0071198547 (International ed. : alk. paper)
035			_a(OCoLC)ocm49704774
040			_aDLC _cDLC _dEYE _dOrLoB-B
042			_apcc
050	0	0	_aQA267.5.S4 _bM29 2003
082	0	0	_a511.3 _221
100	1		_aMartin, John C.
245	1	0	_aIntroduction to languages and the theory of computation / _cJohn C. Martin.
250			_a3rd ed.
260			_aBoston : _bMcGraw-Hill, _cc2003.
300			_axiii, 543 p. : _bill. ; _c24 cm.
504			_aIncludes bibliographical references (p. 529-530) and indexes.
505	0	0	_gPt. I. _tMathematical Notation and Techniques -- _gCh. 1. _tBasic Mathematical Objects -- _gCh. 2. _tMathematical Induction and Recursive Definitions -- _gPt. II. _tRegular Languages and Finite Automata -- _gCh. 3. _tRegular Expressions and Finite Automata -- _gCh. 4. _tNondeterminism and Kleene's Theorem -- _gCh. 5. _tRegular and Nonregular Languages -- _gPt. III. _tContext-Free Languages and Pushdown Automata -- _gCh. 6. _tContext-Free Grammars -- _gCh. 7. _tPushdown Automata -- _gCh. 8. _tContext-Free and Non-Context-Free Languages -- _gPt. IV. _tTuring Machines and Their Languages -- _gCh. 9. _tTuring Machines -- _gCh. 10. _tRecursively Enumerable Languages -- _gPt. V. _tUnsolvable Problems and Computable Functions -- _gCh. 11. _tUnsolvable Problems -- _gCh. 12. _tComputable Functions -- _gPt. VI. _tIntroduction to Computational Complexity -- _gCh. 13. _tMeasuring and Classifying Complexity -- _gCh. 14. _tTractable and Intractable Problems.
650		0	_aSequential machine theory.
650		0	_aComputable functions.
856	4	2	_3Publisher description _uhttp://www.loc.gov/catdir/description/mh024/2002070865.html
856	4	1	_3Table of contents _uhttp://www.loc.gov/catdir/toc/mh023/2002070865.html
900			_bTOC
942			_2lcc _cBK
999			_c1858 _d1858