Multiple Choice
Consider the following statements
I. Recursive languages are closed under complementation
II. Recursively enumerable languages are closed under union
III. Recursively enumerable languages are closed under complementation
Which of the above statement are TRUE?
A) I only
B) I and II
C) I and III
D) II and III
Correct Answer:
Verified
Correct Answer:
Verified
Q30: Which statement is true?<br>A)The PDA must have
Q31: Which of the following problem is undecidable?<br>A)Membership
Q32: The following CFG is in S ?
Q33: Pumping lemma is generally used for proving
Q34: Match all items in Group 1 with
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
Q40: The PDA is called non-deterministic PDA when