edited by
704 views
1 votes
1 votes

Please give reason for the answer.

edited by

1 Answer

Best answer
1 votes
1 votes
Hi after observing them for while I got the answer. I was doing one silly mistake

Here in above question none is CFL. Why?

Reason for 1:-  Not CFL because we need two stacks (2 comparisons in the same language  )

Reason for 2:-  Again 2 stack needed  One for a and b and another for c as {n>m} 

Reason for 3:- When x will become w it will become CSL again more than 2 stacks needed which can be done by LBA or TM .



None is CFL.





 
selected by

Related questions

1 votes
1 votes
1 answer
1
Himanshu1 asked Nov 2, 2015
991 views
Give an example of Unambiguous CFL which is not DCFL .
5 votes
5 votes
2 answers
3
gatecse asked Sep 12, 2014
1,865 views
Which of the following languages are CFL?$$L_1= \left \{ 0^n 1^m \mid n \leq m \leq 2n \right \} \\[1em] L_2 =\left \{ a^i b^j c^k \mid i=2j \text{ or } j=2k \right \}$$
2 votes
2 votes
1 answer
4