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).
মোঃ আরিফুল ইসলাম
Feb 20, 2025