in Theory of Computation edited by
72 views
0 votes
0 votes

Recursive Enumerable Languages are NOT closed under :

  1. Union
  2. Intersection
  3. Complement
  4. Homomorphism
in Theory of Computation edited by
by
72 views

1 Answer

0 votes
0 votes
Best answer

Recursively Enumerable languages were  not closed under complementation . Option C is correct .

see this https://www.quora.com/Why-are-recursively-enumerable-languages-not-closed-under-complementation

selected by
Answer:

Related questions