Q8Theory of Computation
Question
2 marks
Define Pushdown Automata (PDA).
Answer
FA with a stack.
A Pushdown Automata (PDA) is a finite automaton augmented with an infinite stack for extra memory. It is the recognizer for context-free languages.
Define Pushdown Automata (PDA).
FA with a stack.
A Pushdown Automata (PDA) is a finite automaton augmented with an infinite stack for extra memory. It is the recognizer for context-free languages.