Dr H S Behera, Reader in the Department of CSE&IT, Veer Surendra Sai University of Technology (VSSUT), Burla, Odisha, has over 16 years of teaching experience. His research interests are in data mining and soft computing. He has contributed profusely to refereed journals and presented research papers at various national and international conferences and seminars.
Hadibandhu Pattnayak :-
Dr Hadibandhu Pattnayak is Professor and Head at the Department of Mathematics, School of Applied Sciences, KIIT University, Bhubaneswar. He is PhD from Utkal University, has more than 35 years of teaching and research experience, during which he wrote five books and contributed to national and international journals and presented research papers at various conferences and seminars.
Janmenjoy Nayak :-
Janmenjoy Nayak, Gold Medalist (Computer Science) is a DST INSPIRE Fellow, Govt. of India. He is pursuing his doctoral degree at VSSUT, and has more than five years of teaching and research experience. He has contributed to national and international journals and presented research papers at various conferences and seminars.
About the Book
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.
• Concepts of Finite Automata
• Regular Expressions and Regular Grammars
• Context Free Grammars and Languages
• Push Down Automata
• Turing Machine
• Decidability and Undecidability
• Complexity Theory
• 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