MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -Explanation: Push down automata is for Context free languages and they are termed as Type 2 languages according to Chomsky hierarchy.

Detailed explanation-2: -Just as DFA and nondeterministic finite automata (NFA), there are also two types of push-down automata: deterministic push-down automata (DPDA) and non-deterministic push-down automata (NPDA). The languages which can be accepted by PDA are called context-free languages (CFL), denoted by LCF.

Detailed explanation-3: -Context free grammar is called Type 2 grammar because of hierarchy. Explanation: Chomsky hierarchy decide four type of language :Type 3-Regular Language, Type 2-Context free language, Type 1-Context Sensitive Language, Type 0-Unrestricted or Recursively Ennumerable language.

Detailed explanation-4: -So the language accepted by a PDA in which the stack is limited to 10 items is best described as regular.