Skip to content
Related Articles

Related Articles

Improve Article

UGC-NET | UGC NET CS 2014 Dec – III | Question 63

  • Last Updated : 27 Jun, 2018

According to pumping lemma for context free languages:
Let L be an infinite context free language, then there exists some positive integer m such that any w ∈ L with | w | ≥ m can be decomposed as w = u v x y z
(A) with | vxy | ≤ m such that uv i xy i z ∈ L for all i = 0, 1, 2
(B) with | vxy | ≤ m, and | vy | ≥ 1, such that uv i xy iz ∈ L for all i = 0, 1, 2, …….
(C) with | vxy | ≥ m, and | vy | ≤ 1, such that uv i xy iz ∈ L for all i = 0, 1, 2, …….
(D) with | vxy | ≥ m, and | vy | ≥ 1, such that uv ixy iz ∈ L for all i = 0, 1, 2, …….


Answer: (B)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Recommended Articles
Page :