000			02141nam a22002537a 4500
999			_c52710 _d52710
003			CITU
005			20220824113935.0
008			201106b ||||| |||| 00| 0 eng d
020			_a9788120329683
082			_a004.01
100			_aMishra, K. L. P. _eAuthor.
245			_aTheory of computer science : _bAutomata, languages and computation / _cK. L. P. Mishra.
250			_aThird Edition.
264			_aNew Delhi : _bPHI Learning Private Limited, _cc2007.
300			_axiii, 422 pages : _billustrations ; _c24 cm.
500			_aIncludes index.
520			_aThis Third Edition, in response to the enthusiastic reception given by academia and students to the previous edition, offers a cohesive presentation of all aspects of theoretical computer science, namely automata, formal languages, computability, and complexity. Besides, it includes coverage of mathematical preliminaries. Features new to this edition are: expanded sections on pigeonhole principle and the principle of induction (both in Chapter 2); a rigorous proof of Kleene's theorem (Chapter 5); major changes in the chapter on Turing machines (TMs); a new section on high-level description of TMs; techniques for the construction of TMs; multitape TM and nondeterministic TM; a new chapter (Chapter 10) on decidability and recursively enumerable languages; a new chapter (Chapter 12) on complexity theory and NP-complete problems; a section on quantum computation in Chapter 12; objective-type questions in each chapter - with answers provided at the end of the book; eighty-three additional solved examples - added as Supplementary Examples in each chapter; and detailed solutions at the end of the book to chapter-end exercises. The book is designed to meet the needs of the undergraduate and postgraduate students of computer science and engineering as well as those of the students offering courses in computer applications.
526			_a000-099
650			_aUser interfaces (Computer systems) _xTesting
650			_aWeb-based user interfaces _xTesting
650			_aHuman-computer interaction
700			_aChandrasekaran, N. _eAuthor
942			_2ddc _cBK _01