Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this

Table Of Contents

String matching/processing Compiler Construction
Consider the state [q0]:
Consider the state [q0, q1]:
Consider the state [q1]:
Consider the state [q1,q2]:
Consider the state [q2]:
Consider the state [A]:
Consider the state [C]:
Consider the state [D]:
Consider the state [E]:
Regular expressions Meaning
General Method of proof: -
Example 1
Example 2
Example 3
Example 4
Example 5
Converting NFA’s to DFA’s
DFA to NFA Conversion
Automaton to Regular Expression Conversion
Regular Expression to Automaton Conversion
Testing Emptiness of Regular Languages
Testing Membership in a Regular Language
Minimization of Automata (Method 1)
Algorithm 1:
Minimization of Automata (Method 2)
Example 2. (Method1):
Derivation using Grammar
Example 1: Leftmost Derivation
Example 2: Rightmost Derivations
Rightmost Derivation - Tree
Leftmost Derivation
Rightmost derivation
Example 2:
The Language of a Grammar
Sentential Forms
Inherent Ambiguity
Eliminate symbols that are non reachable:
Algorithm to find nullable variables is given below:
Example parse tree:
Pumping Lemma game:
I. Substitution:
II. Application of substitution:
III. Closure under Reversal:
IV. Intersection:
a. Intersection of CFL and Regular Language:
b. CFL and RL properties:
V. Inverse Homomorphism:
Formal Definition:
Example 1:
Graphical Notation of PDA:
Instantaneous Description:
1. Languages of PDA
Accept by Final state:
Accept by empty stack:
2. Conversion between the two forms:
a. From Empty Stack to Final State:
From CFG to PDA:
From PDA to CFG:
DPDA and Regular Languages:
Acceptance with final state:
Acceptance with empty stack:
DPDA and Ambiguous grammar:
A Hierarchy of Formal Languages
Recursively Enumerable Language (r.e. language)
Some Historical Notes
Notation for the Turing Machine:
Solved examples:
TM Example 1:
TM Example 2 :
Modularization of TMs
Sequence of actions in UTM:
Proving Equivalence
Composite Tape TMs
Equivalence of CTMs and TMs
Turing Machines with Stay Option
Equivalence of STMs and TMs
2-way Infinite Turing Machine
Equivalence of 2TMs and TMs
Multi-tape Turing Machines
Equivalence of MTMs and TMs
Multi-dimensional TMs
Equivalence of MDTMs to TMs
Non-deterministic TM
Equivalence of NTMs and TMs
Simulating an NTM with an MDTM
0 of .
Results for:
No results containing your search query
P. 1


Ratings: (0)|Views: 9,646|Likes:
Published by Mike Corpus

More info:

Published by: Mike Corpus on Oct 01, 2011
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





You're Reading a Free Preview
Pages 4 to 47 are not shown in this preview.
You're Reading a Free Preview
Pages 49 to 102 are not shown in this preview.

Activity (16)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
Avneesh Kumar liked this
Garima Verma liked this
Mac Wallace liked this
Rupasree Das liked this
Sunil Panwar liked this
Amit Kumar liked this
s33k_find liked this
Zhemin Li liked this

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->