GATE 2024 · CS1 - Forenoon
Let L1, L2 be two regular languages and L3 a language which is not regular. Which of the following statements is/are always TRUE?
Related Theory of Computation PYQs
Let G = (V, Σ, S, P) be a context-free grammar in Chomsky Normal Form with Σ = {a,b,c} and V containing 10 variable symbols includ…
Consider the following two regular expressions over the alphabet {0,1}: r = 0* + 1* s = 01* + 10* The total number of strings of l…
Which one of the following regular expressions is equivalent to the language accepted by the DFA given below? The DFA has two stat…
Let M be the 5-state NFA with ε-transitions shown in the diagram below: state1 is the start state, with ε-transitions to state2 an…
Consider a context-free grammar G with the following 3 rules. S → aS, S → aSbS, S → c Let w be in L(G). Let na(w), nb(w), nc(w) de…
Let L1 be the language represented by the regular expression b*ab*(ab*ab*)* and L2 = { w in (a+b)* | |w| ≤ 4 }, where |w| denotes …
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.