TY - BOOK AU - Acharjya D.P TI - Theory of Computation SN - 9788180940767 U1 - 005.1 First PY - 2010/// CY - Chennai PB - MJP Publisher KW - Automata Theory KW - Formal Languages KW - Turing Machines KW - Finite Automata KW - Pushdown Automata N1 - Introduction to Theory of Computation Mathematical Preliminaries Finite Automata Regular Languages and Expressions Context-Free Languages Pushdown Automata Turing Machines Chomsky Hierarchy and Grammar Classification Decidability and Computability Complexity Theory Parsing Techniques (LR, LL Grammars) N2 - Theory of Computation by D. P. Acharjya explores the mathematical foundations and principles underlying computation and automata theory. The book covers core topics such as formal languages, automata models, Turing machines, and decidability. It emphasizes mathematical rigor and problem-solving techniques essential for understanding what problems can be solved computationally and how efficiently. The text is structured to help students grasp complex theoretical concepts through clear explanations and examples ER -