edited by
6,786 views
5 votes
5 votes

If $L$ and $P$ are two recursively enumerable languages then they are not closed under

  1. Kleene star $L^*$ of $L$
  2. Intersection $L \cap P$
  3. Union $L \cup P$
  4. Set difference
edited by

2 Answers

Best answer
10 votes
10 votes

Set difference=$L-P =L\cap P^{C}$. Since, recursively enumerable languages are closed under intersection but not under complement, Set difference of these two language is not closed.

Refer : This also 

edited by
0 votes
0 votes
D) SET DIFFERNCE
Answer:

Related questions

10 votes
10 votes
4 answers
1
sh!va asked May 7, 2017
5,370 views
The symmetric difference of sets $\text{A}=\{1,2, 3,4, 5, 6, 7, 8\}$ and $\text{B}= \{1, 3, 5, 6, 7,8,9\}$ is:$\{1, 3, 5, 6, 7,8\}$$\{2, 4, 9\}$$\{2, 4\}$$\{1, 2, 3, 4, 5...
0 votes
0 votes
1 answer
4