1.

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

A. L1 U L2
B. L2 L2
C. Both L1 U L2 and L2 L2
D. None of the mentioned
Answer» D. None of the mentioned


Discussion

No Comment Found

Related MCQs