Which one of the following languages over Σ = {a, b} is NOT context-free?
Consider the following sets: S1: Set of all recursively enumerable languages over {0, 1}. S2: Set of all syntactically valid C pro…
If L is a regular language over Σ = {a, b}, which one of the following languages is NOT regular?
For Σ = {a, b}, let us consider the regular language L = { x | x = a^(2 + 3k) or x = b^(10 + 12k), k >= 0 }. Which one of the foll…
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
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.