Multiple Choice
Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?
A) L1' is recursive and L2' is recursively enumerable
B) L1' is recursive and L2' is not recursively enumerable
C) L1' and L2' are recursively enumerable
D) L1' is recursively enumerable and L2' is recursive
Correct Answer:

Verified
Correct Answer:
Verified
Q9: Consider the set of strings on
Q10: For S € (0+1)* let d(s)denote the
Q11: Consider the language L<sub>1</sub>,L<sub>2</sub>,L<sub>3</sub> as given below.<br>L<sub>1</sub>={0^{p}1^{q}
Q12: Consider the following statements about the context
Q13: The minimum state automaton equivalent to the
Q15: Definition of a language L with alphabet
Q16: Let L<sub>1</sub> be a regular language, L<sub>2</sub>
Q17: Consider the regular language L =(111+11111)*. The
Q18: Consider the languages: GATE[2005]L<sub>1</sub> = {wwR w
Q19: Which of the following problems are decidable?<br>1)