in Theory of Computation recategorized by
351 views
3 votes
3 votes

Which language class has the following properties?

$\quad$ It is closed under union and intersection but not complement.

  1. Regular language
  2. Context-free language
  3. Recursive language
  4. Recursively enumerable language
  5. Languages that are not recursively enumerable
in Theory of Computation recategorized by
351 views

1 Answer

2 votes
2 votes
Best answer

A) regular language is closed under union ,intersection , complement 

B) context free language is closed under union but not closed under intersection and complement 

C)recursive language is closed under union ,intersection, complment

D)recursive enemurable language  is closed under union intersection but it is not closed under complement

E)language NOT RE we can't say anything about it.

SO D) option answer
 

selected by
Answer:

Related questions