made easy cbt1

Question

consider the following languages M and N

M={W$W^{R}$W$W^{R}$ | W$\epsilon$(0,1)*}

N={W1$W1^{R}$W2$W2^{R}$ | W1,W2$\epsilon$(0,1)*

which of the following languages are CFL?

Comments

yes i guess u are correct M is not a CFL

because it will accept 010010 also and it is not of the desired form ww^Rww^R

---

M is not cfl even if we do WWr comparision after that next w should be equal to first one ..which is not possible as nothing will on stack after wwr

---

N is CFL,because it is a concatenation of two CFL languages

M is not because we require more than one stack considering to match string in reverse and straight order.