Theory of Computation Simplified

A theory behind computing machinesDescription 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. What you will learn ● Create finite automata that arent predictable. ● Create regular expressions in any language. ● Convert context-free grammar to Chomsky and Greibachs normal forms. ● Build deterministic and non-deterministic pushdown automata for the regular expression. ● Know the difference between decidability and computability. 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. Table of Contents 1. Finite Automata 2. Non-Deterministic Finite Automata 3. Regular Expressions 4. Context Free Grammar 5. Regular Language 6. Push Down Automata 7. Post Machines 8. Turing Machines 9. Computability and Undecidability 10. Complexity Theory: Advanced Perspective