Computer Sciences > GATE 2014 SET-3 > Regular Expressions
The length of the shortest string NOT in the language (over Σ = {a, b}) of the following regular expression is _________.
(a + b)*bb(a + b)*
(a + b)*bb(a + b)*
Correct : 3
Similar Questions
Consider the following two regular expressions over the alphabet The total number of strings of length less than or equal to 5, which are neither in r nor in s,...
Let L1 be the language represented by the regular expression b*ab*(ab*ab*)* and L2 = {w ∈ (a + b)* | |w| ≤ 4}, where |w| denotes the length of string w. The num...
Which of the following regular expressions represent(s) the set of all binary numbers that are divisible by three? Assume that the string ε is divisible...
Total Unique Visitors
Loading......