GATE Computer Science (CS) 2014 Shift 2 Solved Paper

Question : 45 of 65

Marks: +1, -0

Let < M > be the encoding of a Turing machine as a string over ∑ = {0, 1}. Let L = { < M > | M is a Turing machine that accepts a string of length 2014 }. Then, L is