Theory of Computation and Application- Automata,Formal languages,Computational Complexity (2nd Edition) - 2, #1 - E-book - ePub

Edition en anglais

S. R. Jena

,

Dr. S. K. Swain

Note moyenne 
 S. R. Jena et  Dr. S. K. Swain - Theory of Computation and Application- Automata,Formal languages,Computational Complexity (2nd Edition) - 2, #1.
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).... Lire la suite
18,99 € E-book - ePub
Vous pouvez lire cet ebook sur les supports de lecture suivants :
Téléchargement immédiat
Dès validation de votre commande
Offrir maintenant
Ou planifier dans votre panier

Résumé

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

Caractéristiques

  • Caractéristiques du format ePub
    • Protection num.
      pas de protection

Avis libraires et clients

Avis audio

Écoutez ce qu'en disent nos libraires !

À propos des auteurs

Soumya Ranjan Jena is the Assistant Professor in the School of Computing Science and Engineering at 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. 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.

Souvent acheté ensemble

Vous aimerez aussi

Derniers produits consultés

Theory of Computation and Application- Automata,Formal languages,Computational Complexity (2nd Edition) - 2, #1 est également présent dans les rayons

18,99 €