GATE Computer Science (CS) 2016 Shift 1 Solved Paper
© examsiri.com
Question : 54 of 65
Marks:
+1,
-0
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 YÌ… reduces to W, and Z reduces to XÌ… (reduction means the standard many-one reduction). Which one of the following statements is TRUE?
Let W and Z be two languages such that YÌ… reduces to W, and Z reduces to XÌ… (reduction means the standard many-one reduction). Which one of the following statements is TRUE?
Go to Question: