Mr. Soumya Ranjan Jena is currently working as an Assistant Professor in Department of Computer Science and Technology at Madanapalle Institute of Technology and Science (UGC-Autonomous), Madanapalle, Andhra Pradesh, India. He has completed M.Tech in IT from Utkal University, Bhubaneswar, Odisha, B.Tech in CSE from BPUT, Odisha and CCNA from CTTC. He has published 5 books, 12 Scopus indexed research papers, 23 WoS indexed research papers, and 5 patents. His research interests include Cloud and Distributed Computing, IoT, Green
Computing etc.
Santosh Kumar Swain, Ph.D, is an Professor in School of Computer Engineering at KIIT Deemed to be
University, Bhubaneswar, Odisha. He has over 23 years of experience in teaching to graduate and post-graduate students of computer engineering, information technology and computer applications. He has published more than 40 research papers in International Journals and Conferences and one patent on health monitoring system.
dashboard
Serie
2
|
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
Título : Theory of Computation and Application- Automata,Formal languages,Computational Complexity (2nd Edition)
EAN : 9789386202154
Editorial : Laxmi Publications, New Delhi
El libro electrónico Theory of Computation and Application- Automata,Formal languages,Computational Complexity (2nd Edition) está en formato ePub
¿Quieres leer en un eReader de otra marca? Sigue nuestra guía.
Puede que no esté disponible para la venta en tu país, sino sólo para la venta desde una cuenta en Francia.
Si la redirección no se produce automáticamente, haz clic en este enlace.
Conectarme
Mi cuenta