Computer Sciences > GATE 2021 SET-2 > Regular Expressions
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 by three.
Correct : a; b; c
Similar Questions
The length of the shortest string NOT in the language (over Σ = {a, b}) of the following regular expression is _________.(a + b)*bb(a + b)*
The length of the shortest string NOT in the language (over Σ = {a, b}) of the following regular expression is _________.(a + b)*bb(a + b)*
The length of the shortest string NOT in the language (over Σ = {a, b}) of the following regular expression is _________.(a + b)*bb(a + b)*
Total Unique Visitors
Loading......