What language is accepted by the npda What language is accep

What language is accepted by the npda

What language is accepted by the npda M = ({q_0, q_1, q_2}, {a, b}, {a, b, z}, delta, q_0, z, {q_2}) with transitions delta(q_0, a, z) = {(q_1, a), (q_2, z)} delta (q_1, b, a) = {(q_1, b)} delta (q_1, b, b) = {(q_1, b)} delta (q_1, a, b) = {(q_2, lambda)}

Solution

Answer:

q2 is a final state and when input is a on q0 it can either go to q1 and push a on stack or to q2 n push nothing so min it npda accepts a.
If transition is made from q0 to q1 then it will push a on stack and on q1 if input is b and top of the stack is a then it push b on stack and it see an input a after b it will make a transition to q2 and pop b and the q2 is final state but b can be seen only after a
So it should be a(a a*bb*a)*