Theory of computer science (automata, languages and computation)/ K.L.P. Mishra and N. Chandrasekaran
Material type:
TextPublication details: New Delhi: Prentice-Hall of India, 2005Edition: 2ndDescription: xi, 304 pages: diagrams; 24 cmISBN: - 8120312716
- 9788120312715
- 23 511.35 M678
| Item type | Current library | Call number | Status | Notes | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|
| Books | ISI Library, Kolkata | 511.35 M678 (Browse shelf(Opens below)) | Available | Gifted by SQC Unit | C27443 |
Browsing ISI Library, Kolkata shelves Close shelf browser (Hides shelf browser)
| 511.35 K23 Recursion theory and complexity | 511.35 M175 Quantum cellular automata | 511.35 M379 Introduction to languages and the theory of computation/ | 511.35 M678 Theory of computer science (automata, languages and computation)/ | 511.35 M717 Computations in higher types | 511.35 N849 Recursion on the countable functionals | 511.35 Od24 Classical recursion theory : the theory of functions and sets of natural numbers |
Includes bibliography and index
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
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.
There are no comments on this title.
