In an automata or formal-language problem, which option best represents PDA acceptance by empty stack?

Correct Answer: B

input is accepted when the stack becomes empty under the acceptance rules

In this course context, PDA acceptance by empty stack means input is accepted when the stack becomes empty under the acceptance rules.