Question
In an automata or formal-language problem, which option best represents PDA acceptance by empty stack?
Select an option. Your answer will be checked instantly.
Correct Answer: B. input is accepted when the stack becomes empty under the acceptance rules
Explanation:
In this course context, PDA acceptance by empty stack means input is accepted when the stack becomes empty under the acceptance rules.
Leave a Reply