Theory of computer science : (Record no. 4250)

MARC details
000 -LEADER
fixed length control field 02020pam a2200217a 44500
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 150502b2006 xxu||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9788120329683
040 ## - CATALOGING SOURCE
Transcribing agency BITS Pilani Hyderabad
Original cataloging agency BITS Pilani Hyderabad
041 ## - LANGUAGE CODE
Language code of text/sound track or separate title ENG
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.01 MIS-K
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Mishra, K. L. P.
245 ## - TITLE STATEMENT
Title Theory of computer science :
Remainder of title automata, languages and computation /
Statement of responsibility, etc. K. L. P. Mishra
250 ## - EDITION STATEMENT
Edition statement 3rd ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc. India
Name of publisher, distributor, etc. Prentice Hall of India
Date of publication, distribution, etc. 2006
300 ## - PHYSICAL DESCRIPTION
Extent 436 p.
365 ## - TRADE PRICE
Price type code INR
Price amount 250.00.
500 ## - GENERAL NOTE
General note 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/>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ᅠ
907 ## - LOCAL DATA ELEMENT G, LDG (RLIN)
a 004.01 MIS-K
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
952 ## - LOCATION AND ITEM INFORMATION (KOHA)
Withdrawn status
Holdings
Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Home library Current library Shelving location Date acquired Total Checkouts Full call number Barcode Date last seen Date last checked out Price effective from Koha item type
  Dewey Decimal Classification     003-007 BITS Pilani Hyderabad BITS Pilani Hyderabad General Stack (For lending) 02/05/2015 9 004.01 MIS-K 21658 09/10/2024 01/10/2024 02/05/2015 Books
An institution deemed to be a University Estd. Vide Sec.3 of the UGC
Act,1956 under notification # F.12-23/63.U-2 of Jun 18,1964

© 2024 BITS-Library, BITS-Hyderabad, India.