Q47

MSQ2 marks

Which of the following regular expressions represent(s) the set of all binary numbers that are divisible by three? Assume that the string $\epsilon$ is divisible by three.

(A)

$(0+1(01^*0)^*1)^*$

(B)

$(0+11+10(1+00)^*01)^*$

(C)

$(0^*(1(01^*0)^*1)^*)^*$

(D)

$(0+11+11(1+00)^*00)^*$

Loading…