Using Pumping Lemma Which Of The Following Cannot Be Proved As #603
Using pumping lemma, which of the following cannot be proved as ‘not a CFL’?
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.
Using pumping lemma, which of the following cannot be proved as ‘not a CFL’?
{aibici|i>=0}
{ss|s∈{a,b}*}
The set legal C programs
None of the mentioned
Similar question(s) are as followings:
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
