Multiple Choice
If L and L¯ are recursively enumerable, then L is
A) Regular
B) Context free
C) Context sensitive
D) Recursive
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q21: Following syntax-directed translation scheme is used with
Q22: Let the class of language accepted by
Q23: What is the highest type number which
Q24: TM is more powerful than FSM because<br>A)The
Q25: Let L<sub>1</sub> be a recursive language. Let
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
Q30: Which statement is true?<br>A)The PDA must have
Q31: Which of the following problem is undecidable?<br>A)Membership