edited by
449 views
2 votes
2 votes

edited by

2 Answers

Best answer
4 votes
4 votes

Ans should be 2

L1 : CFL 

Reason: Context free grammar for this language 

S--> 0S1 / 1S0 / 0S0 / 1S1 / 0

(ODD) 0 (ODD) = ODD length strings

(Even) 0 (Even) = ODD length strings 

L2: CFL ( easily you can visualise )

L3: CSL ( because here Total comparison >= 2 for same symbol. 1comparison:  first time number 'a' should be equal to last time number of 'a'. 2 comparison: 'b' in middle should not equal to the number of 'a'.)

Please let know if I am wrong.

selected by
1 votes
1 votes
Language L1 and L2 (Or is given ) are CFL in L3 we have to check First that number of "A" should not be equal to number of "B" from both side. Hence only two language are CFL please correct me if I am wrong

Related questions

0 votes
0 votes
1 answer
4