Theory of Computation and Application by S.R.Jena, S.K.Swain

This book is intended for the students who are pursuing courses in B.Tech/B.E (CSE/IT), M.Tech/M.E (CSE/IT), MCA, M.Sc (CS/IT). The book covers different crucial theoretical aspects such as of Automata Theory, Formal Language Theory, Computability Theory and Computational Complexity Theory and their applications.

This book can be used as a text or reference book for a one-semester course in theory of computation or automata theory. It includes the detailed coverage of

• Introduction to Theory of Computation
• Essential Mathematical Concepts
• Finite State Automata
• Formal Language & Formal Grammar
• Regular Expressions & Regular Languages
• Context-Free Grammar
• Pushdown Automata
• Turing Machines
• Recursively Enumerable & Recursive Languages
• Complexity Theory

KEY FEATURES

• Presentation of concepts in clear, compact and comprehensible manner
• Chapter-wise supplement of theorems and formal proofs
• Display of chapter-wise appendices with case studies, applications and some pre-requisites
• Pictorial two-minute drill to summarize the whole concept
• Inclusion of more than 400 solved with additional problems
• Questions of GATE with their keys for the aspirants to have the thoroughness, practice and multiplicity
• Key terms, Review questions and Problems at chapter-wise termination