Theory Of Computation And Application

By S. R. Jena, S. K. Swain more
686 Views
Selling Price : ₹74.00
MRP : ₹495.00
You will save : ₹421.00 after 85% Discount

Buy Ebook₹148.50 Rental Ebook Up to 85% Off
Select your rental days
Enter your email id to read this ebook
Submit

Save extra with 3 Offers

Get ₹ 50

Instant Cashback on the purchase of ₹ 400 or above
LAXMI50 Already Applied

NEW35

Get Flat 35% Off on your First Order

Product Specifications

Publisher Laxmi Publications All MCA - Master of Computer Applications books by Laxmi Publications
ISBN 9789386202154
Author: S. R. Jena, S. K. Swain
Number of Pages 424
Available
Available in all digital devices

Frequently Bought Together

Theory Of Computation And Application
Theory Of Computation And Application
₹148.50 ₹495.00
Current Selection
Strength Of Materials
Strength Of Materials
₹378.00 ₹600.00
Building Technology And Materials
Building Technology And Materials
₹268.20 ₹425.00
Selected items : 2
Offer Price : You Save :
  • Snapshot
  • About the book
Theory Of Computation And Application - Page 1 Theory Of Computation And Application - Page 2 Theory Of Computation And Application - Page 3 Theory Of Computation And Application - Page 4 Theory Of Computation And Application - Page 5

Theory Of Computation And Application by S. R. Jena, S. K. Swain
Book Summary:

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 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

Audience of the Book :
This book Useful for BCA, MCA, Computer Science & IT Student.
Table of Content :

CHAPTER 0. A ROADMAP TO THE BOOK

CHAPTER 1. OUT-SET

CHAPTER 2. MATHEMATICAL PRE-VIEW

CHAPTER 3. FINITE STATE AUTOMATA

CHAPTER 4. FORMAL LANGUAGES AND FORMAL GRAMMAR

CHAPTER 5. REGULAR EXPRESSIONS AND REGULAR LANGUAGES

CHAPTER 6. CONTEXT-FREE GRAMMAR

CHAPTER 7. PUSHDOWN AUTOMATA

CHAPTER 8. TURING MACHINES

CHAPTER 9. RECURSIVELY ENUMERABLE AND RECURSIVE LANGUAGES

CHAPTER 10. A KEY TO COMPLEXITY THEORY

Appendix

References

Short Type Questions with Answers

Model Question Papers for Practice

Index

Related Information Technology Books
Books similar to Theory Of Computation And Application
x