GATE 2021 · Set-2
Let L be a subset of {0,1}* be an arbitrary regular language accepted by a minimal DFA with k states. Which one of the following languages must necessarily be accepted by a minimal DFA with k states?
Related Theory of Computation PYQs
Suppose that L1 is a regular language and L2 is a context-free language. Which one of the following languages is NOT necessarily c…
Let <M> denote an encoding of an automaton M. Suppose that Σ = {0,1}. Which of the following languages is/are NOT recursive?
For a Turing machine M, <M> denotes an encoding of M. Consider the following two languages. L1 = {<M> | M takes more than 2021 ste…
The number of strings of length 100 accepted by the below pushdown automaton is _______________.
Let L1 be a regular language and L2 be a context-free language. Which of the following languages is/are context-free?
Consider the following two statements about regular languages: S1: Every infinite regular language contains an undecidable languag…
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.