GATE 2022
Which one of the following regular expressions correctly represents the language of the finite automaton shown in the figure?
Related Theory of Computation PYQs
Which of the following statements is/are TRUE?
Which of the following is/are undecidable?
Consider the following languages: L1 = {\(a^{n}\) w \(a^{n}\) | w in {a,b}*} L2 = {w x \(w^{R}\) | w, x in {a,b}*, |w|,|x| > 0} No…
Consider the following languages: L1 = {w w | w in {a,b}*} L2 = {\(a^{n}\) \(b^{n}\) \(c^{m}\) | m,n ≥ 0} L3 = {\(a^{m}\) \(b^{n}\…
Consider the following grammar where S is the start symbol, and a and b are terminal symbols. S → aSbS | bS | ε Which of the follo…
Let M be a nondeterministic finite automaton (NFA) with 6 states over a finite alphabet. Which of the following options CANNOT be …
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.