Theory of Computation(TOC): A Introduction to Formal Languages and Automata Theory

This book has been written by Mr. ChandraBhushan Kumar Guest Faculty B.D. College Patna is suitable for the students of MCA B.Tech(CSE & IT) and M.Sc.(CS) courses as well as for the students studying Pure Mathematic in M.Sc. There are four chapters categorized in this book viz. (i) Introduction to Grammar Languages and Automata (ii) Regular Language and Finite Automata (iii) Context Free Languages & Push Down Automata and (iv) Turing Machines REC RE and Decidability. Every chapter contains rich amount of diagrams to illustrate the mathematical ideas as well as the theoretical concepts of machines more clearly. Students can learn from this book to understand not only the theoretical concepts of computation but also will know the application areas of these computational machines. Upon successful study of this book the students will be able to explain the models of computation including formal languages grammars and automata and their connections analyze and design Finite Automata Pushdown Automata Turing Machines Formal Languages and Grammars solve computational problems regarding their computability and complexity and prove the basic results of the theory of computation and will be able to build the strong foundation who are desire to research in this field.