GATE 2008
The language L = {<M> | M is a Turing Machine that accepts the string 'gate'} is:
Related Theory of Computation PYQs
Which of the following statements is false?
Which of the following is true for the language { ap | p is prime} ?
Let L be a regular language. Which of the following operations is NOT closed for regular languages?
Which of the following pairs of regular expressions are NOT equivalent?
Which of the following problems on Turing machines is decidable?
Which of the following statements about regular expressions and finite automata is FALSE?
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.