Which of the following statements is (are) correct ?
| A. | Recursive languages are closed under complementation. |
| B. | If a language and its complement are both regular, the language is recursive |
| C. | Set of recursively enumerable language 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. |
