Computer Sciences > GATE 2024 Set-2 > Regular Expressions
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 number of strings in L2 which are also in L1 is ___________.
Correct : 9
Similar Questions
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...
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...
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......