Theory of Computation 1st Edition

0.0

Theory of Computation is designed to serve as a textbook for undergraduate students of computer science and engineering, computer applications, and information technology. It provides a comprehensive coverage of all the essential concepts of the subject. The book begins with basic concepts such as symbols, alphabets, sets, relations, graphs, strings, and languages. It then delves into the important topics, including separate chapters on finite state machine, regular expressions, grammars, pushdown stack, Turing machine, parsing techniques, Post machine, undecidability, and complexity of problems. The chapter on production systems describes a computational model, called Markov and labelled Markov algorithms, which is different from the Turing model. A comprehensive coverage of topics combined with a highly detailed pedagogy covering plenty of solved examples, figures, notes, flow charts, and chapter-end exercises makes this text a complete package for students. Salient Features Presents each procedure in the text in algorithmic form for the readers to practise the concepts in any programming language of their choice Includes several solved examples in each chapter for better recapitulation of the concepts learnt Provides numerous objective type questions with answers, review questions, and exercises at the end of every chapter, graded as per Bloom's taxonomy principles Includes appendices containing the implementation details and C source codes for all the important algorithms discussed in the book, and five model question papers to assist students in preparing for their university examinations ONLINE RESOURCES The following resources are available to help the faculty and students using this text: For faculty PowerPoint slides Solutions manual For students Source codes of all the programs provided in the book Solutions to model test papers given in Appendix B About the Author Vivek Kulkarni is Principal Architect, Persistent Systems Ltd. He has more than 18 years of experience in academia and the software industry. In the past, he has served as subject chairman for multiple subjects in the Board of Computer Engineering, University of Pune. He has also worked in organizations such as BMC Software, Symantec Corporation, and Tech Mahindra. He is also one of the inventors of System and Method of Universal Programming Language Conversion, which has been internationally recognized and patented.

0.0

Chapter 1. Preliminaries Chapter 2. Finite state machines Chapter 3. Regular expressions Chapter 4. Turing machines Chapter 5. Grammars Chapter 6. Pushdown stack-memory machine Chapter 7. Parsing techniques Chapter 8. Post machine Chapter 9. Undecidability Chapter 10. Complexity and classification of problems Chapter 11. Production systems Appendix A: Implementations Appendix B: Model question papers Glossary  Bibliography Index Was this product information helpful? Yes No Thanks for your comment! Thanks for your vote! Please write your feedback before submitting. Skip var ugcFeedbackTooltip = new FKART.ui.Tooltip({ nearElement: $("body"), cssClass: "ugc-feedback-tooltip", message: ' ' });