Which of the following statement(s) is/are correct?
| A. | L = {an bn an | n = 1, 2, 3...} is recursively enumerable |
| B. | Recursive languages are closed under union |
| C. | Every recursive is closed under union |
| D. | All of these |
Answer : D Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
