Interline Publishing +91 98867 328 23 / 24 / 25   +91 80 2333 2824 Sign Up   Sign In
Interline Publishing
Skip to Reader

Set up video

    Subscription offer
         (Unlimited Download)
Amount Validity
र 100 6 months
र 200 1 year
Title      : Finite Automata and Formal Languages
Subject      : Formal Languages and Automata Theory
copyright ©  2018     : Sri Nandi Publications
Author      : Padma Reddy A M
Publisher      : Sri Nandi Publications
Chapters/Pages      : 9/438
Total Price      : Rs.      : 65
To Purchase, select the individual chapter(s) or click "Select all" for the complete book.

Please scroll down to view chapter(s).
Introduction to Finite Automata Total views (98)  
This chapter contains topics such as: Central concepts of Automata theory, Deterministic Finite Automata, Non-deterministic Finite Automata with numerous examples
Pages: 110
Price: Rs 0   
Finite Automata and Regular Expressions Total views (26)  
This chapter contains various topics such as:An application of finite automata, Finite automata with -transitions, Regular expressions, Finite automata and regular expressions, Applications of regular expressions
Pages: 60
Price: Rs 12   
Regular Languages & Properties of Regular Languages Total views (8)  
This chapter includes various topics such as: Regular languages, Proving languages not to be regular languages, Closure properties of regular languages, Decision properties of regular languages, Equivalence and minimization of automata
Pages: 44
Price: Rs 8.8   
Context Free Grammars & Languages Total views (16)  
This chapter includes various topics such as: Context free grammars, Parse trees, Applications, Ambiguity in grammars and Languages and numerous examples to write regular and context free grammars
Pages: 37
Price: Rs 7.4   
Context Free Grammars (Continued) Total views (10)  
It contains numerous examples that shows how to write grammars for various types of langauges
Pages: 29
Price: Rs 5.8   
Pushdown Automata Total views (12)  
This chapter contains various topics such as: Definition of the Pushdown automata, The languages of a PDA, Equivalence of PDA‟s and CFG‟s, Deterministic Pushdown Automata.
Pages: 50
Price: Rs 10   
Properties of Context Free Langauges Total views (12)  
This chapter deals with Normal forms for CFG, The pumping lemma for CFGs, Closure properties of CFLs
Pages: 36
Price: Rs 7.2   
Turing Machines Total views (5)  
This chapter includes topics such as: Turing machines, Programming techniques for Turing machines, Extensions to the basic Turing machines,  Turing machines and computers, Multiple turing machines etc.
Pages: 66
Price: Rs 13.2   
Undecidability Total views (10)  
This chapter includes topics such as: A Language that is not recursively enumerable, An Un-decidable problem that is RE, Postís Correspondence problem, Other un-decidable problems.
Pages: 6
Price: Rs 1.2   

About Us
Contact Us
Advertising Guidelines
Safe and Secure Payment
All major credit and debit cards are accepted.
Policies: Terms of Use | Privacy    Copyright © 2018 Interline Publishing. All rights reserved.