IISER Logo
The OPAC site is under construction.

Theory of computer science : (Record no. 4120)

MARC details
000 -LEADER
fixed length control field 02158nam a2200277Ia 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240829155650.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 240709s9999 xx 000 0 und d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9788120329683
040 ## - CATALOGING SOURCE
Transcribing agency IISER-BPR
041 ## - LANGUAGE CODE
Language code of text/sound track or separate title ENG
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004
Item number MIS
Edition number 23rd
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Mishra, K. L. P.
222 ## - KEY TITLE
Key title Computer and Data Sciences
245 #0 - TITLE STATEMENT
Title Theory of computer science :
Remainder of title Automata, languages and computation
250 ## - EDITION STATEMENT
Edition statement 3rd ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc Delhi:
Name of publisher, distributor, etc PHI Learning Pvt. Ltd.,
Date of publication, distribution, etc c2024
300 ## - PHYSICAL DESCRIPTION
Extent xiii, 422p. :
Other physical details ill, pbk. ;
Dimensions 24cm
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/>• Expanded sections on pigeonhole principle and the principle of induction (both in Chapter 2)<br/>• A rigorous proof of Kleene’s theorem (Chapter 5)<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/>• A new chapter (Chapter 10) on decidability and recursively enumerable languages<br/>• A new chapter (Chapter 12) on complexity theory and NP-complete problems<br/>• A section on quantum computation in Chapter 12.<br/><br/>• KEY FEATURES:-<br/>• Objective-type questions in each chapter—with answers provided at the end of the book.<br/>• Eighty-three additional solved examples—added as Supplementary Examples in each chapter.<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.<br/><br/>Also includes illustrations and index.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Science
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name Chandrasekaran, N.
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type Books
Source of classification or shelving scheme Dewey Decimal Classification
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
947 ## - LOCAL PROCESSING INFORMATION (OCLC)
a 495
948 ## - LOCAL PROCESSING INFORMATION (OCLC); SERIES PART DESIGNATOR (RLIN)
Series part designator, SPT (RLIN) 0.22
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Date acquired Source of acquisition Cost, normal purchase price Total Checkouts Full call number Barcode Date last seen Cost, replacement price Price effective from Koha item type
    Dewey Decimal Classification     Vigyanpuri Campus Vigyanpuri Campus 27/08/2024 44 386.10   004 MIS 007262 27/08/2024 386.10 27/08/2024 Books