| 000 -LEADER |
|---|
| fixed length control field |
02141nam a22002537a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
CITU |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20220824113935.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
201106b ||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9788120329683 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
004.01 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Preferred name for the person |
Mishra, K. L. P. |
| Relator term |
Author. |
| 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 |
Third Edition. |
| 264 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
New Delhi : |
| Name of publisher, distributor, etc |
PHI Learning Private Limited, |
| Date of publication, distribution, etc |
c2007. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xiii, 422 pages : |
| Other physical details |
illustrations ; |
| Dimensions |
24 cm. |
| 500 ## - GENERAL NOTE |
|---|
| General note |
Includes index. |
| 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. Features new to this edition are: expanded sections on pigeonhole principle and the principle of induction (both in Chapter 2); a rigorous proof of Kleene's theorem (Chapter 5); 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; a new chapter (Chapter 10) on decidability and recursively enumerable languages; a new chapter (Chapter 12) on complexity theory and NP-complete problems; a section on quantum computation in Chapter 12; objective-type questions in each chapter - with answers provided at the end of the book; eighty-three additional solved examples - added as Supplementary Examples in each chapter; and detailed solutions at the end of the book to chapter-end exercises. 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. |
| 526 ## - STUDY PROGRAM INFORMATION NOTE |
|---|
| -- |
000-099 |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
User interfaces (Computer systems) |
| General subdivision |
Testing |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Web-based user interfaces |
| General subdivision |
Testing |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Human-computer interaction |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Chandrasekaran, N. |
| Relator term |
Author |
| 942 ## - ADDED ENTRY ELEMENTS |
|---|
| Source of classification or shelving scheme |
|
| Item type |
BOOK |
| Issues (borrowed), all copies |
1 |