Theory of Computation and Application- Automata,Formal languages,Computational Complexity (2nd Edition) / 2 (ePub)
This book is intended for the students who are pursuing courses in B.Tech/B.E. (CSE/IT), M.Tech/M.E. (CSE/IT), MCAand M.Sc (CS/IT). The book covers different crucial theoretical aspects such as of Automata Theory, Formal Language...
- Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
ABOUT THE BOOK:
This book is intended for the students who are pursuing courses in B.Tech/B.E. (CSE/IT), M.Tech/M.E. (CSE/IT), MCAand 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 of Introduction to Theory of Computation, Essential Mathematical Concepts, Finite State Automata, Formal Language & Formal Grammar, Regular Expressions & Regular Languages, Context-Free Grammar, Pushdown Automata, Turing Machines, Recursively Enumerable & Recursive Languages, Complexity Theory.
Key Features:
« Presentation of concepts in clear, compact and comprehensible manner
« Chapter-wise supplement of theorems and formal proofs
« Display of chapter-wise appendices with case studies, applications and some pre-requisites
« Pictorial two-minute drill to summarize the whole concept
« Inclusion of more than 200 solved with additional problems
« More than 130 numbers of GATE questions with their keys for the aspirants to have the thoroughness, practice and multiplicity
« Key terms, Review questions and Problems at chapter-wise termination
What is New in the 2nd Edition:
« Introduction to Myhill-Nerode theorem in Chapter-3
« Updated GATE questions and keys starting from the year 2000 to the year 2018
«Simulation through JFLAP Simulator
Galgotias University, Greater Noida, U.P., India. Previously he has worked at GITA, Bhubaneswar, Odisha, K L
Deemed to be University, A.P and AKS University, M.P, India. He has more than 5 years of teaching experience.
He has been awarded M.Tech in IT, B.Tech in CSE and CCNA. He is the author of Design and Analysis of
Algorithms book published by University Science Press, Laxmi Publications Pvt. Ltd, New Delhi.
- Autoren: S. R. Jena , S. K. Swain
- 2022, Englisch
- Verlag: Laxmi Publications, New Delhi
- ISBN-10: 9386202158
- ISBN-13: 9789386202154
- Erscheinungsdatum: 07.07.2022
Abhängig von Bildschirmgrösse und eingestellter Schriftgrösse kann die Seitenzahl auf Ihrem Lesegerät variieren.
- Dateiformat: ePub
- Grösse: 10 MB
- Mit Kopierschutz
- Vorlesefunktion
eBooks und Audiobooks (Hörbuch-Downloads) mit der Familie teilen und gemeinsam geniessen. Mehr Infos hier.
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Theory of Computation and Application- Automata,Formal languages,Computational Complexity (2nd Edition) / 2".
Kommentar verfassen