GATE 1993
A language L is recursive if and only if there exists a Turing Machine M such that:
Related Theory of Computation PYQs
Arden's Theorem states that if P and Q are regular expressions over Σ, and P does not contain ε, then the equation R = Q + RP has …
Which of the following regular expressions denotes the language of all strings over {0, 1} having an odd number of 0s and an even …
If L1 is regular and L2 is regular, which of the following is NOT necessarily regular?
Let L be the set of all binary strings where the number of 0s is divisible by 3 and the number of 1s is divisible by 5. What is th…
Let L be any regular language. Which of the following operations is guaranteed to preserve regularity?
Which of the following grammar classes strictly contains the class of regular grammars?
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.