Peter Linz Edition 5 Exercise 11.1 Question 12 (Page No. 284)

46 views
Let $L_1$ be recursive and $L_2$ recursively enumerable. Show that $L_2-L_1$ is necessarily recursively enumerable.

1 vote

$L_2 - L_1 = L_2 \cap {L_1}^c$

Now, complement of a recursive language is always recursive - so ${L_1}^c$ is recursive and hence recursively enumerable too.

Intersection of two recursively enumerable languages always gives a recursively enumerable language (Recursively Enumerable set is closed under union and intersection but not under complement).

So, $L_2 - L_1$ is guaranteed to be recursively enumerable.

selected
• Recursive is closed under complement.
• Recursive ennum is closed under intersection .

Related questions

1
54 views
Prove that the complement of a context-free language must be recursive.
1 vote
Is the family of recursive languages closed under concatenation$?$