Which of the following automata takes stack as auxiliary storage?
(a) Finite automata
(b) Push down automata
(c) Turing machine
(d) All of the mentioned
I have been asked this question in a national level competition.
I want to ask this question from PDA-acceptance by Empty Stack in portion Push Down Automata of Automata Theory