GATE 2014 · Set-2
Which of the following decision problems regarding formal languages is UNDECIDABLE?
Related Theory of Computation PYQs
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…
Let Σ be a finite non-empty alphabet and let 2^(Σ*) be the power set of Σ*. Which of the following is TRUE?
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…
Let A≤mB denotes that language A is mapping reducible (also known as many-to-one reducible) to language B.Which one of the followi…
Let Σ be a finite non-empty alphabet and let 2Σ* be the power set of Σ*. Which one of the following is TRUE?
Which of the following regular expressions represents the language of all strings over {0, 1} that start with '0' and end with '1'…
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.