000			02158nam a2200277Ia 4500
003			OSt
005			20240829155650.0
008			240709s9999 xx 000 0 und d
020			_a9788120329683
040			_cIISER-BPR
041			_aENG
082			_a004 _bMIS _223rd
100			_aMishra, K. L. P.
222			_aComputer and Data Sciences
245		0	_aTheory of computer science : _bAutomata, languages and computation
250			_a3rd ed.
260			_aDelhi: _bPHI Learning Pvt. Ltd., _cc2024
300			_axiii, 422p. : _bill, pbk. ; _c24cm
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. NEW TO THIS EDITION:- • 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. • KEY FEATURES:- • 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. • 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. Also includes illustrations and index.
650			_aComputer Science
700			_aChandrasekaran, N.
942			_cBK _2ddc
942			_2ddc
947			_a495
948			_a0.22
999			_c4120 _d4120