JNU CS M.Phil 2019 Shift-1
October 26, 2023JNU 2018-1 PhD CS
October 26, 2023JNU 2018-1 PhD CS
| Question 1 |
Recursively enumerable languages are not closed under
| concatenation | |
| complement | |
| union | |
| homomorphism |
Question 1 Explanation:
Recursively enumerable languages are closed under concatenation,union,homomorphism but not closed under complementation
Correct Answer: B
Question 1 Explanation:
Recursively enumerable languages are closed under concatenation,union,homomorphism but not closed under complementation