The book introduces the fundamental concepts of the theory of computation, formal languages and automata right from the basic building blocks to the depths of the subject. The book begins by giving prerequisites for the subject, like sets, relations and graphs, and all fundamental proof techniques.It proceeds forward to discuss advanced concepts like Turing machine, its language and construction, an illustrated view of the decidability and undecidability of languages along with the post-correspondence problem. KEY FEATURES • Simple and easy-to-follow text • Complete coverage of the subject as per the syllabi of most universities • Discusses advanced concepts like Complexity Theory and various NP-complete problems • More than 250 solved examples
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.