Turing Machine: RE, REC and Undecidability GATE 2008 Question #8465 with Solution

GATE 2008

Theory of ComputationTuring Machine: RE, REC and UndecidabilityeasyMCQ1 mark

Which of the following problems is Turing-decidable (recursive)?

AChecking whether a given DFA accepts the empty string εBChecking whether a given Turing machine accepts the empty string εCChecking whether a given CFG generates all strings (L(G) = Σ*)DChecking whether the language of a given Turing machine is finite

Save your progress

Related Theory of Computation PYQs

GATE 2008

Which of the following statements is false?

GATE 2008

Which of the following is true for the language { ap | p is prime} ?

GATE 2008

Let L be a regular language. Which of the following operations is NOT closed for regular languages?

GATE 2008

The language L = {<M> | M is a Turing Machine that accepts the string 'gate'} is:

GATE 2008

Which of the following pairs of regular expressions are NOT equivalent?

GATE 2008

Which of the following problems on Turing machines is decidable?

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.

Related Theory of Computation PYQs

Turn practice into measurable progress