MCQOPTIONS
Saved Bookmarks
| 1. |
Choose the correct option:Statement: If L1 and L2 are recursively ennumerable languages over S, then the following is/are recursively ennumerable.a) L1 U L2b) L2 ∩ L2c) Both ( |
| A. | L1 U L2b) L2 ∩ L2c) Both (a) and ( |
| B. | L2 ∩ L2 |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |