Consider the following PDA that is accepted by empty stack.
[3 + 5 +7]
First draw a graphical representation of the PDA.
Then, convert this PDA that is accepted by empty stack to its equivalent PDA accepted by final state
- you need to show a graphical representation of the model.
Now, apply the string baba to the given PDA or your converted PDA to check whether it is accepted or not.