Computer Sciences > Gate 2016 Set-1 > Recursive Language
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?
Correct : Recursive Language
Similar Questions
Let A and B be infinite alphabets and let # be a symbol outside both A and B. Let f be a total functional from A* to B* .We say f is computable if there exists...
A palindrome is a word that reads the same forwards and backwards. In a game
of words, a player has the following two plates painted with letters.
From...
Which number does not belong in the series below?
2, 5, 10, 17, 26, 37, 50, 64
Total Unique Visitors
Loading......