made easy 2019

Question

L={a*b*c* – {$a^{n}b^{n}c^{n}$ ;$n\geq 0$}

shouldn’t L be recursive??

bcoz $a^{n}b^{n}c^{n}$ is recursive and its complement is also recursive;

a*b*c* is regular ;

therefore, regular $\cap$ recursive = recursive..

Comments

yes

---

After looking there explanation we can construct NPDA i guess so it will be CFL as it boils down to comparison on two alphabets

---

but how will we get to know , which approach is to be applied?

i left this question in the test bcoz of this reason only, bcoz i was getting CSL  for L2