000			01553cam a2200277 a 4500
001			vtls000001422
003			VRT
005			20250102224906.0
008			081102s1998 njua |b 001 0 eng
020			_a0132624788
039		9	_a201402040051 _bVLOAD _c201005230958 _dmalmash _c200811020810 _dNoora _c200811020810 _dNoora _y200811020809 _zNoora
050	0	0	_aQA267 _b.L49 1998
100	1		_aLewis, Harry R. _91099
245	1	0	_aElements of the theory of computation / _cHarry R. Lewis, Christos H. Papadimitriou.
250			_a2nd ed.
260			_aUpper Saddle River, N.J. : _bPrentice-Hall, _cc1998.
300			_a361 p. : _bill. ; _c25 cm.
504			_aIncludes bibliographical references and index.
505			_a1. Sets, Relations, and Languages. 2. Finite Automata. 3. Context-free Languages. 4. Turing Machines. 5. Undecidability. 6. Computational Complexity. 7. NP-completeness. Index.
520			_aAppropriate for senior and graduate level courses in Computer Science Theory, Automata, and Theory of Computation. This is the long awaited Second Edition of Lewis and Papadimitriou's best-selling theory of computation text. In this substantially modified edition, the authors have enhanced the clarity of their presentation by making the material more accessible to a broader undergraduate audience with no special mathematical experience.
650		0	_aMachine theory. _91100
650		0	_aFormal languages. _91101
650		0	_aComputational complexity. _91102
650		0	_aLogic, Symbolic and mathematical. _91103
942			_2lcc _n0 _cBK
999			_c23199 _d23199