A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Pumping -lemma for context-free languages states :
Let Lbe an infinite context free language. Then there exists some positive integer m such that any w ∈ L with Iwl ≥m can be decomposed as w = uv xy Z with Ivxyl_________ and Ivy I such that uvz, xyZ
Z ∈ L for all z = 0, 1,2, .......
a. ≤m, ≤1
b. ≤m,≥1
c. ≥m,≤1
d. ≥m, ≥1
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: