A PDA where all State are Accepting State. A string is accepted by a ES-PDA there is a way for to read all of and finish with the stack empty.
A PDA where all State are Accepting State. A string x is accepted by a ES-PDA M⟺ there is a way for M to read all of x and finish with the stack empty.