TESTBOOK TEST SERIES

Question

WHAT WILL BE THE ANS?

Answer 1

Since whatever the input, the npda remains in final state, this state accepts all input, but for n(p), i can easily create a rule like

(q,a,Z)->(q,z)

(q,b,Z)->(q,θ)

Now n(p) only accepts string ending with b.

So answer should be A

Comments

WHERE DO U FIND THAT N(P) ONLY ACCEPTS STRING ENDING WITH b?

---

That was just an example i chose to state the fact that n(p) could accept only selected language but p always accepts all language.