GATE CSE 2014 SET-2
Q51.
Let \lt M \gt be the encoding of a Turing machine as a string over \Sigma={0,1}. Let L = { \lt M \gt |M is a Turning machine that accepts a string of length 2014}. Then, L isQ52.
Let A \leq _{m}B denotes that language A is mapping reducible (also known as many-to-one reducible) to language B. Which one of the following is FALSE?Q53.
Let k = 2^{n} . A circuit is built by giving the output of an n-bit binary counter as input to an n-to-2^{n} bit decoder. This circuit is equivalent to a