Register

Recent questions tagged pumping-lemma

27 votes
1 answer
65
Michael Sipser exercise
For each of the following languages, give the minimum pumping length and justify your answer. 0001* 0*1* 001 ∪ 0* 1* 0*1$^+$0$^+$1* ∪ 10*1 (01)* ε 1*01*01* 10(11*0)*0 1011 Σ*
For each of the following languages, give the minimum pumping length and justify your answer.0001* 0*1*001 ∪ 0* 1*0*1$^+$0$^+$1* ∪ 10*1(01)*ε1*01*01*10(11*0)*01011Σ...
User Avatar
0 votes
0 answers
67
TOpic test zeal
User Avatar
0 votes
0 answers
68
Pumping lemma
What exactly does it means when we say that a particular string can be pumped or not in pumping lemma?,,.. and consequently what is the pumping length for a regular language in pumping lemma?
What exactly does it means when we say that a particular string can be pumped or not in pumping lemma?,,.. and consequently what is the pumping length for a regular langu...
User Avatar
0 votes
0 answers
69
TOC - Doubt
The logic of pumping leema is good example of The Pigeon Hole Principle. Can anyone please explain this?
The logic of pumping leema is good example of The Pigeon Hole Principle. Can anyone please explain this?
User Avatar
2 votes
1 answer
72
Pumping Lemma
The proof of pumping lemma is an example of :- (A) iteration (B) recursion (C) pigeonhole principle (D) None of These
The proof of pumping lemma is an example of :-(A) iteration(B) recursion(C) pigeonhole principle(D) None of These
User Avatar
1 votes
2 answers
74
UGC NET CSE | November 2017 | Part 3 | Question: 21
Pumping lemma for regular language is generally used for proving Whether two given regular expressions are equivalent A given grammar is ambiguous A given grammar is regular A given grammar is not regular
Pumping lemma for regular language is generally used for provingWhether two given regular expressions are equivalentA given grammar is ambiguousA given grammar is regular...
User Avatar
5 votes
1 answer
75
UGC NET CSE | November 2017 | Part 3 | Question: 19
The logic of pumping lemma is an example of _________ Iteration Recursion The divide and conquer principle The pigeon – hole principle
The logic of pumping lemma is an example of _________IterationRecursionThe divide and conquer principleThe pigeon – hole principle
User Avatar
0 votes
1 answer
78
Pumping lemma for regular grammer
True/False Pumping lemma is generally used to prove whether given grammar is not regular.
True/FalsePumping lemma is generally used to prove whether given grammar is not regular.
User Avatar
0 votes
0 answers
79
TOC Pumping Lemma
In pumping lemma it says if there is a string whose length is >=N,where N is number of states in dfa,then language of machine is infinite,but there is one upper constraing also. 2N-1>=|W|>=N Can anyone tell me about the use of 2N-1 here ?
In pumping lemma it says if there is a string whose length is >=N,where N is number of states in dfa,then language of machine is infinite,but there is one upper constrain...
User Avatar
0 votes
1 answer
80
Is there any example for PUMPING LEMMA proves that L given IS a CFL?
many examples are available for using pumping lemma to prove a language dies NOT belong to CFG. Is there any example for PUMPING LEMMA proves that L given IS a CFL? Please share it..
many examples are available for using pumping lemma to prove a language dies NOT belong to CFG.Is there any example for PUMPING LEMMA proves that L given IS a CFL?Please ...
User Avatar
4 votes
2 answers
82
Pumping Lemma
User Avatar
0 votes
1 answer
83
Pumping Lemma
how to prove that these are not Regular using Pumping Lemma {0n15n∣n≥10000} & for also n≤10000
how to prove that these are not Regular using Pumping Lemma {0n15n∣n≥10000} & for also n≤10000
User Avatar
0 votes
0 answers
84
Pumping lemma
Why does the pumping lemma (weaker one) fails
Why does the pumping lemma (weaker one) fails
User Avatar
0 votes
1 answer
87
Pumping Lemma RL CFL & Pumping Length
What is the basic Conditions for Pumping Lemma of RL and CFL I found different ans in different sources Also Tell me what is a pumping length ? IS there any minimum pumping length or something ?
What is the basic Conditions for Pumping Lemma of RL and CFLI found different ans in different sourcesAlso Tell me what is a pumping length ?IS there any minimum pumping ...
User Avatar
4 votes
1 answer
89
Pumping Lemma
Prove or Disprove below language is regular or not L1={w|w∈∑* where w visit all state of M atleast once where M is machine accepting L1 L2={w|w∈∑* where w visit all state of M equal no of times where M is machine accepting L2
Prove or Disprove below language is regular or notL1={w|w∈∑* where w visit all state of M atleast once where M is machine accepting L1 L2={w|w∈∑* where ...
User Avatar
Page: