MARC details
000 -LEADER |
fixed length control field |
02597nam a22002777a 4500 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
ISI Library, Kolkata |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20240702152143.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
240702b |||||||| |||| 00| 0 eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
8120312716 |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9788120312715 |
040 ## - CATALOGING SOURCE |
Original cataloging agency |
ISI Library |
Language of cataloging |
English |
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
Edition number |
23 |
Classification number |
511.35 |
Item number |
M678 |
100 1# - MAIN ENTRY--PERSONAL NAME |
Personal name |
Mishra, K.L.P. |
Relator term |
author |
245 10 - TITLE STATEMENT |
Title |
Theory of computer science (automata, languages and computation)/ |
Statement of responsibility, etc |
K.L.P. Mishra and N. Chandrasekaran |
250 ## - EDITION STATEMENT |
Edition statement |
2nd |
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
Place of publication, distribution, etc |
New Delhi: |
Name of publisher, distributor, etc |
Prentice-Hall of India, |
Date of publication, distribution, etc |
2005 |
300 ## - PHYSICAL DESCRIPTION |
Extent |
xi, 304 pages: |
Other physical details |
diagrams; |
Dimensions |
24 cm. |
504 ## - BIBLIOGRAPHY, ETC. NOTE |
Bibliography, etc |
Includes bibliography and index |
505 0# - FORMATTED CONTENTS NOTE |
Formatted contents note |
Mathematical 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 ## - SUMMARY, ETC. |
Summary, etc |
Theory 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# - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Automata |
650 0# - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Robots |
650 0# - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Computer Science |
700 1# - ADDED ENTRY--PERSONAL NAME |
Personal name |
Chandrasekaran, N. |
Relator term |
author |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
Dewey Decimal Classification |
Koha item type |
Books |