Let L Be A Cfl Then There Is An Integer N So That For Any U #601

Let L be a CFL. Then there is an integer n so that for any u that belong to language L satisfying<br /> |t|>=n, there are strings u, v, w, x, y and z satisfying<br /> t=uvwxy.<br /> Let p be the number of variables in CNF form of the context free grammar. The value of n in terms of p is

This multiple choice question (MCQ) is related to the book/course gs gs101 Automata Theory. It can also be found in gs gs101 Properties of Context Free Languages - Pumping Lemma for Context Free Language - Quiz No.1.