| 000 -LEADER |
|---|
| fixed length control field |
02085nam a22001577a 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| ISBN |
9789819762330 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
004.23 |
| Item number |
C5528 2025 |
| 100 ## - MAIN ENTRY--AUTHOR NAME |
|---|
| Personal name |
Chowdhary, K. R., author. |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Theory of computation : automata, formal languages,computation and complexity / K. R. Chowdhary |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication |
Singapore : |
| Name of publisher |
Springer, |
| Year of publication |
c2025. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Number of Pages |
1 online resource, xxxvii, 664 pages : |
| Other physical details |
some color illustrations. |
| 500 ## - GENERAL NOTE |
|---|
| General note |
Includes bibliographical references and index. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
This book offers a fresh perspective on the study and teaching of the Theory of Computation. The author's selection of topics and the comprehensive set of questions demonstrate extensive knowledge and years of experience in both teaching and research. It addresses practical aspects of computing models that are often overlooked. The book's emphasis on pedagogy, through carefully crafted exercises and clear elucidation of learning outcomes and chapter summaries, is a refreshing approach to the subject. With the right platform, this book has the potential to be adopted as a textbook in universities worldwide. The book covers new developments not typically addressed in other texts on the subject, such as algebraic theory, new applications of finite automata and regular languages, and topics from compiler theory that are closely related. It also explores several new relationships among models, with a natural progression of chapters. Key strengths of this book include its coverage of contemporary and relevant topics, practical applications of theoretical concepts, an extended Chomsky Hierarchy, and discussions on decidability, undecidability, and unsolvability. The book is tailored for its intended audience, with selected chapters suitable for undergraduate B.Tech./B.E. computer science students. Additionally, Chapters 914 can be used for a course on "Advanced Topics in Theory of Computer Science" at the Master's level (M.E./M.Tech.). It also serves as a foundational resource for those engaged in research in computer science
|
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Machine theory. |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
Electronic Books |
CSU-Carig