Theory of Computer Science: Automata, Languages and Computation (Record no. 42184)

MARC details
000 -LEADER
fixed length control field 01913 a2200193 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9788120329683
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.01 MIS
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Mishra, K. L. P
245 ## - TITLE STATEMENT
Title Theory of Computer Science: Automata, Languages and Computation
250 ## - EDITION STATEMENT
Edition statement 3rd ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Name of publisher, distributor, etc Prentice Hall of India
Place of publication, distribution, etc New Delhi
Date of publication, distribution, etc 2022
300 ## - PHYSICAL DESCRIPTION
Extent 422
520 ## - SUMMARY, ETC.
Summary, etc This 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.<br/><br/>NEW TO THIS EDITION<br/><br/>• Expanded sections on pigeonhole principle and the principle of induction (both in Chapter 2)<br/><br/>• A rigorous proof of Kleene’s theorem (Chapter 5)<br/><br/>• 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<br/><br/>• A new chapter (Chapter 10) on decidability and recursively enumerable languages<br/><br/>• A new chapter (Chapter 12) on complexity theory and NP-complete problems<br/><br/>• A section on quantum computation in Chapter 12.<br/><br/>• KEY FEATURES<br/><br/>• Objective-type questions in each chapter—with answers provided at the end of the book.<br/><br/>• Eighty-three additional solved examples—added as Supplementary Examples in each chapter.<br/><br/>• Detailed solutions at the end of the book to chapter-end exercises.<br/><br/>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.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Science
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Machine Theory
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Programming
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name Chandrasekaran, N
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Koha item type Book

No items available.