000			01651nam a2200289 a 4500
001			vtls000001421
003			VRT
005			20250102222425.0
008			081102s1998 nju | 001 0 eng d
020			_a0132727412 (International edition)
020			_a8178084872 (Indian rpt., low price ed.)
039		9	_a201402040051 _bVLOAD _c201303110751 _dalawaid _c201303110746 _dalawaid _c201303110745 _dalawaid _y200811020805 _zNoora
050			_aQA267 _b.L49 1998
100	1		_aLewis, Harry R. _91099
245	1	0	_aElements of the theory of computation / _bHarry R. Lewis, Christos H. Papadimitriou.
250			_a2nd ed.
260			_aUpper Saddle River ; _aLondon : _bPrentice-Hall International, _cc1997.
300			_a361 p. : _bill. ; _c23 cm.
504			_aIncludes bibliographical references and index.
505	0	0	_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			_c313 _d313