Page 1 of 1

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

Posted: Thu Jul 14, 2022 9:26 am
by answerhappygod
a) L1 U L2
b) L2 ∩ L2
c) Both L1 U L2 and L2 ∩ L2
d) None of the mentioned