Question
What is meant by PDA acceptance by empty stack in Theory of Automata and Formal Languages?
Select an option. Your answer will be checked instantly.
Correct Answer: A. input is accepted when the stack becomes empty under the acceptance rules
Explanation:
The correct answer is input is accepted when the stack becomes empty under the acceptance rules.
Leave a Reply