Peter Linz Edition 4 Exercise 7.1 Question 9 (Page No. 183)

Question

Is it possible to find a dfa that accepts the same language as the pda

                       $M= (${$q_0,q_1$},{$a,b$},{$z$},$\delta,q_0,z,${$q_1$}),
with

                       $\delta(q_0,a,z)=${$(q_1,z)$},

                       $\delta(q_0,b,z)=${$(q_0,z)$},

                       $\delta(q_1,a,z)=${$(q_1,z)$},

                       $\delta(q_1,b,z)=${$(q_0,z)$} ?

Answer 1

Yes, I think it is accepting the language ending with a.

So, finite automata would be possible.