Multiple Choice
The PDA is called non-deterministic PDA when there are more than one out going edges from……… state:
A) START or READ
B) POP or REJECT
C) READ or POP
D) PUSH or POP
Correct Answer:

Verified
Correct Answer:
Verified
Q35: Consider the following statements<br>I. Recursive languages are
Q36: All NonNull words of the CFL can
Q37: Which of the following denotes Chomskianhiearchy?<br>A)REG ?
Q38: Let S and T be language over
Q39: If PCP is decidable then MPCP is<br>A)Decidable<br>B)Undecidable<br>C)Can't
Q41: FSM can recognize<br>A)Any grammar<br>B)Only CG<br>C)Both (a) and
Q42: Consider the following Finite State Automaton The
Q43: PCP is:<br>A)Decidable<br>B)Undecidable<br>C)Sometimes Decidable<br>D)None of the
Q44: Which one of the following is true
Q45: Recursively enumerable languages are not closed under<br>A)Union<br>B)homomorphism<br>C)complementation<br>D)concatenation