The language accepted by Push down Automaton:
(a) Recursive Language
(b) Context free language
(c) Linearly Bounded language
(d) All of the mentioned
I had been asked this question in my homework.
I'd like to ask this question from The Language of a Grammar, Inferences and Ambiguity in section Context Free Grammars and Languages of Automata Theory