Pushdown Automaton:
A pushdown automaton (PDA) is a type of automaton that extends the capabilities of a finite automaton by adding a stack. It is a theoretical device used to recognize context-free languages, which are a subset of the recursively enumerable languages.

Context-Free Languages:
Context-free languages are a class of formal languages that can be generated by a context-free grammar. These languages are recognized by pushdown automata. A context-free grammar consists of a set of production rules that specify how to rewrite a non-terminal symbol into a sequence of terminal and/or non-terminal symbols.

Pushdown Automaton and Context-Free Languages:
A pushdown automaton is specifically designed to recognize context-free languages. It uses a stack to keep track of the context of the input string being processed. The stack allows the automaton to store information and retrieve it later when necessary.

Recursive Languages:
Recursive languages are a class of formal languages that can be recognized by a Turing machine. A Turing machine is a theoretical device that can simulate any other computational device. While pushdown automata can recognize context-free languages, they are not powerful enough to recognize recursive languages.

Linearly Bounded Languages:
Linearly bounded languages are a class of formal languages in which the amount of memory used by a Turing machine is bounded by a linear function of the size of the input. The memory of a pushdown automaton, however, is unbounded, as it uses a stack to store information.

Conclusion:
The language accepted by a pushdown automaton is a context-free language. While pushdown automata are not powerful enough to recognize recursive languages or linearly bounded languages, they are specifically designed to recognize context-free languages. Therefore, the correct answer is option 'B' - Context free language.