About Product
Theory of Computation emphasizes the topics such as automata, abstract models of computation, and computability. It also includes computational complexity, P and NP completeness.The book covers the entire syllabus prescribed by Anna University for BE (CSE), JNTU, Hyderabad and Nagpur University. This book also meets the requirements of students preparing for various competitive examinations. Professionals and research workers can also use this book as a ready reference.Salient Features
Tags:
Language;
Programing;
Theories;