Which of the following languages is generated by the given grammar: S -> aS | bS | ε?

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…

Consider the transition diagram of a PDA with Σ = {a, b} and stack alphabet Γ = {X, Z}. Z is the initial stack symbol. Transitions…

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 _…