Choose the correct option: Statement: If L1 and L2 are recursively enumerable languages over S, then the following is/are recursively enumerable.

Choose the correct option: Statement: If L1 and L2 are recursively enumerable languages over S, then the following is/are recursively enumerable. Correct Answer Both L1 U L2 and L2 ∩ L2

Both the union and intersection operations preserve the property of recursive enumerablity(Theorem).
Bissoy MCQ

Related Questions

Recursively enumerable languages are not closed under ______________
Which of the following is/are not true for recursively enumerable language?
The class of recursively enumerable language is known as:
A recursively enumerable language L can be recursive if: