1.

Recursively enumerable languages are not closed under ______________(a) Union(b) Intersection(c) Complementation(d) Concatenation

Answer» Right choice is (c) Complementation

To explain: Recursive languages are closed under the following operations.

The Kleene star L * of L

the concatenation L * o P of L and P

the union L U P

the intersection L ∩ P.


Discussion

No Comment Found

Related InterviewSolutions