Question
What is meant by PDA in Theory of Automata and Formal Languages?
Select an option. Your answer will be checked instantly.
Correct Answer: A. a finite automaton equipped with a stack
Explanation:
The correct answer is a finite automaton equipped with a stack.
Leave a Reply