-
Consider the machine M :
The language recognized by M is
-
- {W ∈ (a, b)* | every a in W is followed by exactly two b's}
- {W ∈ (a, b)* | every a in W is followed by at least two b's}
- {W ∈ (a, b)* | W contains the substring abb}
- {W ∈ (a, b)* | W does not contain aa as a substring}
- {W ∈ (a, b)* | every a in W is followed by exactly two b's}
Correct Option: B
a is followed by two or more than 2b's so the language recognized by M is { W ∈ {a,b} * |.
