Theory of Computation and Application- Automata,Formal languages,Computational Complexity (2nd Edition)

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

1141696671
Theory of Computation and Application- Automata,Formal languages,Computational Complexity (2nd Edition)

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

20.0 In Stock
Theory of Computation and Application- Automata,Formal languages,Computational Complexity (2nd Edition)

Theory of Computation and Application- Automata,Formal languages,Computational Complexity (2nd Edition)

Theory of Computation and Application- Automata,Formal languages,Computational Complexity (2nd Edition)

Theory of Computation and Application- Automata,Formal languages,Computational Complexity (2nd Edition)

eBook

$20.00 

Available on Compatible NOOK devices, the free NOOK App and in My Digital Library.
WANT A NOOK?  Explore Now

Related collections and offers

LEND ME® See Details

Overview

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


Product Details

BN ID: 2940166652355
Publisher: Laxmi Publications, New Delhi
Publication date: 07/07/2022
Series: 2
Sold by: Draft2Digital
Format: eBook
File size: 12 MB
Note: This product may take a few minutes to download.

About the Author

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.


Mr. Soumya Ranjan Jena is currently working as Faculty Associate in the Department of Computer Science and Engineering at the École Centrale School of Engineering, Mahindra University, Hyderabad, India. He received his M. Tech degree in Information Technology form Utkal University, Bhubaneswar, Odisha, India in the year 2013, B. Tech in Computer Science and Engineering degree from BPUT, Rourkela, Odisha, India in the year 2010 and also certified by CCNA and Diploma in Computer Hardware and Networking Management from CTTC, Bhubaneswar, Odisha, India in the year 2011. He has more than 8 years of teaching experience from various reputed Universities and Colleges in India.

He is basically an Academician, an Author, a Researcher, a Trainer, a Reviewer of various International Journals and International Conferences and a Keynote Speaker. His publications have more than 300 citations, h index of 9, and i10 index of 8 (Google Scholar). He has published 19 international level books, around 27+ international level research articles in various international journals, conferences, and filed 20+ international patents. He has been awarded by Bharat Education Excellence Awards in the year 2022, Excellent Performance in Educational Domain & Outstanding Contributions in Teaching in the year 2022 and Best Researcher by Gurukul Academic Awards in 2022. His research interests include Cloud and Distributed Computing, Internet of Things, Green Computing, Sustainability, Renewable Energy Resources, Internet of Energy etc.

He can be reached by Email: soumyajena1989@gmail.com.

From the B&N Reads Blog

Customer Reviews