Theory of computation and application:Automata,Formal languages,Computational Complexity(2nd Edition)

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 ofIntroduction to Theory of ComputationEssential Mathematical ConceptsFinite State AutomataFormal Language & Formal GrammarRegular Expressions & Regular LanguagesContext-Free GrammarPushdown AutomataTuring MachinesRecursively Enumerable & Recursive LanguagesComplexity TheoryKEY FEATURESPresentation of concepts in clear, compact and comprehensible mannerChapter-wise supplement of theorems and formal proofsDisplay of chapter-wise appendices with case studies, applications and some pre-requisitesPictorial two-minute drill to summarize the whole conceptInclusion of more than 400 solved with additional problemsQuestions of GATE with their keys for the aspirants to have the thoroughness, practice and multiplicityKey terms, Review questions and Problems at chapter-wise terminationWhat is New in the 2nd EditionIntroduction to Myhill-Nerode theorem in Chapter-3Updated GATE questions and keys starting from the year 2020 to the year 2018

Disclaimer:

• Theory of computation and application:Automata,Formal languages,Computational Complexity(2nd Edition) book is not for reading online or for free download in PDF or eBook format.
• Table of Contents, Index, Syllabus, summary and image of Theory of computation and application:Automata,Formal languages,Computational Complexity(2nd Edition) may be of a different edition or of the same title.
• Price can change due to reprinting, price change by publisher or sourcing cost change for imported books.