Which of the following languages is generated by the given grammar: S -> aS | bS | ε?
Which of the following decision problems are undecidable? I. Given NFAs N1 and N2, is L(N1) ∩ L(N2) = Φ? II. Given a CFG G and a s…
Which one of the following regular expressions represents the set of all binary strings having two consecutive 0s and two consecut…
Consider the following grammars. \[ \begin{aligned} G_1 &: S \to aS \mid B, \quad B \to b \mid bB \\ G_2 &: S \to aA \mid bB…
Let X be recursive, Y be RE but not recursive. Let W and Z be languages such that Y' reduces to W, and Z reduces to X'. Which stat…
The number of states in the minimum sized DFA that accepts the language defined by the regular expression (0+1)* (0+1) (0+1)* is _…
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.