In a Pushdown Automata, a string is accepted if there is a computation such that:

A$-$ All the input is consumed OR The last state is an accepting state

B$-$ All the input is consumed AND The last state is an accepting state

C$-$ All the input is consumed AND the stack is empty

D$-$ All the input is consumed OR the stack is empty