Theory of Computation Simplified
Dr. Varsha H. Patil, Dr. Vaishali S. Pawar, Dr. Swati A. Bhavsar, Dr. Abholi H. Patil
Authors: Dr. Varsha H. Patil, Dr. Vaishali S. Pawar, Dr. Swati A. Bhavsar, Dr. Aboli H. Patil
Publishing Date: 23rd Aug 2022
Dimension: 7.5*9.25 Inches
Book Type: Paperback
A theory behind computing machines
- Algorithmic ideas are made simple to understand through the use of examples.
- Contains a wide range of examples and solutions to help students better grasp the concepts.
- Designed to assist and coach students in applying the fundamentals of computation theory in real-world situations.
The book is geared toward those who thirst for computation theory knowledge. To cater to the demands of a wide range of people, the principles in this book are explained in a way that is easy to understand, digest and apply in the upcoming career.
The 'Theory of Computation' is the foundational and mathematical topic in computer science, computer applications, computer Engineering, and software engineering. This book provides a clear introduction to the fundamental principles, followed by an in-depth mathematical study and a wealth of solved problems. Before reading this book, learners must understand basic sets, functions, trees, graphs and strings. The book as a whole acquaints the reader with automata theory fundamentals. The book provides simplified theoretical coverage of the essential principles, solve instances, and solve multiple-choice problems with solutions. The theory and computation of automata presented in this book will greatly assist students and professors alike.
WHAT YOU WILL LEARN
- Create finite automata that aren't predictable.
- Create regular expressions in any language.
- Convert context-free grammar to Chomsky and Greibach's normal forms.
- Build deterministic and non-deterministic pushdown automata for the regular expression.
- Know the difference between decidability and computability.
- Create a Turing machine based on a specified regular expression.
WHO THIS BOOK IS FOR
This book is suitable for undergraduate and graduate students in computer science, information technology and software engineering with a basic understanding of set theory and boolean logic.
- Finite Automata
- Non-Deterministic Finite Automata
- Regular Expressions
- Context Free Grammar
- Regular Language
- Push Down Automata
- Post Machines
- Turing Machines
- Computability and Undecidability
- Complexity Theory: Advanced Perspective
Dr. Varsha H. Patil: She is currently working as HOD(Computer Engineering) and Vice-Principal, Matoshri College of Engineering and Research Centre, Eklahare, Nashik. She is a chairman of BoS of Computer Engineering of Savitribai Phule Pune University. She has 31+ years of teaching experience. She has 3 patent and 13+ copyrights in her account. She has published 50+ papers in various National and International Journals and Conferences. She has published 2 books titled as “Data Structures Using C++” and “Discrete Mathematics”.
Dr. Vaishali S. Pawar: She is currently working as HOD(Computer Engineering) , KBT’s College of Engineering and Research Centre, Nashik. She has 20+ years of teaching experience. She has published 20+ papers in various National and International Journals and Conferences.
Dr. Swati A. Bhavsar: She is currently working as Associate Professor in Department of Computer Engineering of Matoshri College of Engineering and Research Centre, Nashik. She is a member of BoS of Computer Engineering of Savitribai Phule Pune University. She has 17+ years of teaching experience. She has 1 patent and 10 copyrights in her account. She has published 25+ papers in various National and International Journals and Conferences. She has published 2 books titled as Theory of Computation and Design and Analysis of Algorithms.
Dr. Aboli H. Patil: She is working as Consultant at Technology and Strategy, Germany. She has 5+ years of teaching and Industrial experience. She has 1 patent and 4copyrights in her account. She has published 5+ papers in various National and International Journals and Conferences.