1.

Using pumping lemma, which of the following cannot be proved as ‘not a CFL’?

A. {aibici|i>=0}
B. {ss|s∈{a,b}*}
C. The set legal C programs
D. None of the mentioned
Answer» E.


Discussion

No Comment Found