-
The length of the shortest string NOT in the language (over ∑ = {a, b}) of the following regular expression is
______________.
a*b* (ba)*a*
-
- 0
- 3
- 6
- 9
Correct Option: B
a * b * (ba) * a *
Length O is present (as it accepts ∈)
Length 1 is present (a, b)
Length 2 is present (aa, ab, ba, bb)
Length 3 is not present (bab not present)
∴ it is 3
