Register

Online Test Series

• retagged by
812 views
0 votes
0 votes

L1 = {an bm | n ≤ m ≤ 2n}

L2 = {an bm│m≠n & m≠2n}

Which of the following is true?

A. Only L1 is CFG

B. Only L2 is CFG

C. Both are CFG

D. None of them is CFG

• retagged by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
4 answers
1
Satbir asked Jan 13, 2020
2,124 views
ISRO2020-39
The language which is generated by the grammar $S \rightarrow aSa \mid bSb \mid a \mid b$ over the alphabet of $\{a,b\}$ is the set of Strings that begin and end with the same symbol All odd and even length palindromes All odd length palindromes All even length palindromes
The language which is generated by the grammar $S \rightarrow aSa \mid bSb \mid a \mid b$ over the alphabet of $\{a,b\}$ is the set ofStrings that begin and end with the ...
User Avatar
3 votes
3 votes
4 answers
2
Harit asked Apr 25, 2016
5,556 views
Consider the following grammar. How many back tracks are required to generate the string aab from the above grammar?
Consider the following grammar. How many back tracks are required to generate the string aab from the above grammar?S → aB | aAbA → bAb | aB → aB | ε
User Avatar
Link Copied!