Theory of Computation (With Formal Languages)
This book has very simple and practical approach to make the understood the concept of automata theory and languages well. There are many solved descriptive problems and objective (multiple choices) questions, which is a unique feature of this book. The multiple choice questions provide a very good platform for the readers to prepare for various competitive exams.
- Preliminaries Used in Theory of Computation
- Introduction to Finite Automata
- Finite State Machines (Transducers)
- Grammars and Languages
- Regular Expressions, Regular Languages and Finite Automata
- Context-free Grammars and Languages
- Pushdown Automata and Parsing Techniques
- Turing Machine
- Computability and Recognizability of Turing Machine
- Decidability and Undecidability
- Introduction to Computational Complexity
Customer Feedback
No reviews yet. Be the first to review this product!
Other Books by Author(s)
View AllIf you are a professor or educator and would like to request a review copy of Theory of Computation (With Formal Languages) for your institution, please fill in the form below or write to us at contact@khannabooks.com.