Question
a.
{a^ib^ic^i|i>=0}
b.
{ss|s∈{a,b}*}
c.
The set legal C programs
d.
None of the mentioned
Posted under Formal Languages and Automata Theory
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Using pumping lemma, which of the following cannot be proved as ‘not a CFL’?
Similar Questions
Discover Related MCQs
Q. State true or false:
Statement: We cannot use Ogden’s lemma when pumping lemma fails.
View solution
Q. Which of the following cannot be filled in the blank below?
Statement: There are CFLs L1 nad L2 so that ___________is not a CFL.
View solution
Q. The pumping lemma is often used to prove that a language is:
View solution
Q. What is the pumping length of string of length x?
View solution
Q. Which of the following does not obey pumping lemma for context free languages ?
View solution
Q. The context free languages are closed under:
View solution
Q. Given Grammar G1:
S->aSb
S->e
Grammar G2:
R->cRd
R->e
If L(G)=L(G1) U L(G2), the number of productions the new starting variable would have:
View solution
Q. Context free languages are not closed under:
View solution
Q. Which of the following is incorrect?
There exists algorithms to decide if:
View solution
Q. If the start symbol is one of those symbols which produce no terminal through any sequence, the CFL is said to be
View solution
Q. Using the pumping constant n, If there is a string in the language of length between _____ and ____ then the language is infite else not.
View solution
Q. Which of the following is/are CFL not closed under?
View solution
Q. If L1 and L2 are context free languages, L1-L2 are context free:
View solution
Q. A___________ is context free grammar with atmost one non terminal in the right handside of the production.
View solution
Q. There is a linear grammar that generates a context free grammar
View solution
Q. The following format of grammatical notation is accepted by which of the following:
AB->CD
A->BC or
A->B or
A->a
where A, B, C, D are non terminal symbols and a is a terminal symbol.
View solution
Q. Every Kuroda Normal form grammar generates ___________
View solution
Q. Which of the following can generate Unrestricted grammars?
View solution
Q. Given a grammar in GNF and a derivable string in the grammar with the length n, any ___________will halt at depth n.
View solution
Q. Which of the following grammars is similar to Floyd Normal form?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
