A language is accepted by a push down automata if it is:
(a) regular
(b) context free
(c) both (a) and (b)
(d) none of the mentioned
The question was asked during an online exam.
My question is based upon Regular Languages and D-PDA in section Push Down Automata of Automata Theory