Solved

Let L1 Be a Recursive Language

Question 25

Multiple Choice

Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?


A) L2- L1 is recursively enumerable
B) L1-L3 is recursively enumerable
C) L2 intersection L1 is recursively enumerable
D) L2 union L1 is recursively enumerable

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q20: Context free grammar is not closed under<br>A)Product

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

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

Q30: Which statement is true?<br>A)The PDA must have