Theory of Computation (Automata)
Which of the following best names the concept in which an automaton that uses a stack to recognize context-free languages?
- A. Regular expression
- B. Pushdown automaton ✓
- C. Finite automaton
- D. Chomsky hierarchy
Correct answer
B. Pushdown automaton
Explanation
Pushdown automaton refers to an automaton that uses a stack to recognize context-free languages.