Assignment – 10 Regular and Nonregular Languages

B. H. Gardi College of Engineering and Technology,Rajkot
Department of MCA
MCA Semester – II
Subject: 620007 – Theory of Computation
Assignment – 10 
Regular and Nonregular Languages


1
Indistinguishability Relation ( x IL y )
2
Pumping Lemma for Regular Languages
3
Pumping Length
4
What is Meaning of Pumping?
5
Up Pumping
6
Down Pumping
7
Weak Form of Pumping Lemma
8
Even Weaker Form of Pumping Lemma
9
Algorithm for Minimal Finite Automata

Comments

Popular posts from this blog

Solved Exercises John C. Martin

Types of Turing Machines

Difference between DFA and NFA