GATE CS 2016 Set-1 Solutions | Recursive & Recursively Enumerable Languages | Q13 from GATE 2022 📚

GATE CS 2016 SET-1 Q: Let X be a recursive language and Y be a recursively enumerable but not recursive language. Let W and Z be two languages such that reduces to W, and Z reduces to (reduction means the standard many-one reduction). Which one of the following statements is TRUE?

GATE Previous Year Questions with detailed explanation question by question
Website: https://solutionsadda.in/
ISRO / DRDO PYQs: https://solutionsadda.in/isro/
GATE PYQs : https://solutionsadda.in/gate1/
NIC - NIELIT PYQs: https://solutionsadda.in/nielit/

ISRO Complete Analysis: https://solutionsadda.in/isro-complete-analysis/
NIC-NIELIT Complete Analysis: https://solutionsadda.in/nielit/
GATE Complete Analysis: https://solutionsadda.in/gate-complete-analysis/

For GATE, BARC, ISRO, CIL, AAI, HAL, UGC NET JRF, NIC NIELIT, STQC NIELIT, NVS, KVS, DSSSB PGT/TGT
Test series : https://solutionsadda.in/test-series/ && http://new.solutionsadda.in/index.php/home/testseriesall

If you have any queries write a mail: solutionsadda.in@gmail.com
Face Book Page: https://www.facebook.com/Solutionsaddain-111628724482494
Telegram: https://t.me/solutionsaddaforcse