doubt regarding pda

Question

Why is the answer c??

Answer 1

For any PDA, make a new state and do an epsilon transition to the start state and change the start state to the new state.

Similarly make a new state and make an epsilon transition from all accept states to this new state. Now, make another new state and make an epsilon transition from the new state to this one and make this final new state the only accept state.

Thus we get a simple PDA for any given PDA (thanks to epsilon transitions). Now, is this possible without epsilon transition?

Comments

Add new state, and null-transitions from old finals to that new state, then one more state from it with only incoming transition (that too with null transition).

I think It is not possible to do it without null transitions with given conditions, as some languages maybe union of different languages having different terminating/starting conditions.

---

I assumed PDA is accepting by final state. So, we can join all final states via null transition rt?

---

Right.
and Not possible without null transition.