000			02597nam a22002777a 4500
003			ISI Library, Kolkata
005			20240702152143.0
008			240702b |||||||| |||| 00| 0 eng d
020			_a8120312716
020			_a9788120312715
040			_aISI Library _bEnglish
082			_223 _a511.35 _bM678
100	1		_aMishra, K.L.P. _eauthor
245	1	0	_aTheory of computer science (automata, languages and computation)/ _cK.L.P. Mishra and N. Chandrasekaran
250			_a2nd
260			_aNew Delhi: _bPrentice-Hall of India, _c2005
300			_axi, 304 pages: _bdiagrams; _c24 cm.
504			_aIncludes bibliography and index
505	0		_aMathematical preliminaries -- The theory of automata -- Formal languages -- Regular sets and regular grammars -- Context-free languages -- Pushdown automata -- Turing machines -- Linear bounded automata -- LR(k) grammars -- Computability -- Propositions and predicates
520			_aTheory Of Computer Science: Theory, Automata, And Computation is a book that is useful for those who actively pursue the habit of inculcating knowledge in computer science. This comprehensive academic book covers formal computer languages and computation. The automata theory is the study of abstract machines and their application in solving computational problems. Automata is a major part of this book, and is explained elaborately throughout in easily comprehensible ways. Besides providing readers with a detailed introduction to the theories related to computer science, this book also fully covers mathematical preliminaries which are essential to computation. The 3rd edition of Theory Of Computer Science: Theory, Automata, And Computation comes updated with the latest breakthroughs made in the rapidly changing field of computer science. This edition has incorporated new chapters and sections on topics such as the NP class of the computational theory and quantum computability. 83 different solved examples have been included as supplementary examples over the course of the book for every chapter, and thus help students in testing their knowledge of the concepts they learn in each chapter. In addition, explanatory solutions have been provided at the end of the book for the questions given towards the conclusion of each chapter. In order to help improve the problem-solving capabilities of students, the author has also made sure that every chapter in this book includes objective-type questions.
650	0		_aAutomata
650	0		_aRobots
650	0		_aComputer Science
700	1		_aChandrasekaran, N. _eauthor
942			_2ddc _cBK
999			_c434103 _d434103