Theory of Computation
Price: 1000.00 INR
We sell our titles through other companies
Disclaimer :You will be redirected to a third party website.The sole responsibility of supplies, condition of the product, availability of stock, date of delivery, mode of payment will be as promised by the said third party only. Prices and specifications may vary from the OUP India site.
ISBN:
9780198084587
Publication date:
12/04/2013
Paperback
544 pages
242.0x184.0mm
Price: 1000.00 INR
We sell our titles through other companies
Disclaimer :You will be redirected to a third party website.The sole responsibility of supplies, condition of the product, availability of stock, date of delivery, mode of payment will be as promised by the said third party only. Prices and specifications may vary from the OUP India site.
ISBN:
9780198084587
Publication date:
12/04/2013
Paperback
544 pages
242.0x184.0mm
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.
Suitable for: Theory of Computation is designed to serve as a textbook for undergraduate students of computer science and engineering, computer applications, and information technology.
Rights: World Rights
Description
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.
Table of contents
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
Chapter10.COMPLEXITY AND CLASSIFICATION OF PROBLEMS
Chapter11.PRODUCTION SYSTEMS
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
Description
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.
Read MoreTable of contents
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
Chapter10.COMPLEXITY AND CLASSIFICATION OF PROBLEMS
Chapter11.PRODUCTION SYSTEMS
