Multiple Choice
Which statement is true?
A) The PDA must have one accept state and one reject state
B) The PDA must have one accept state and two reject state
C) The PDA must have two accept state and two reject state
D) There is no reject state in the PDA.
Correct Answer:
Verified
Correct Answer:
Verified
Q25: Let L<sub>1</sub> be a recursive language. Let
Q26: If L and L¯ are recursively enumerable,
Q27: Which of the following statement is wrong?<br>A)Any
Q28: The language accepted by a Push down
Q29: For two regular languages L<sub>1</sub> = (a
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
Q35: Consider the following statements<br>I. Recursive languages are