Which of the following automata takes queue as an auxiliary storage?
(a) Finite automata
(b) Push down automata
(c) Turing machine
(d) All of the mentioned
The question was asked in an international level competition.
Asked question is from PDA-acceptance by Empty Stack topic in division Push Down Automata of Automata Theory