Which of the following regular expressions represent(s) the set of all binary…

GATE · 2021 · CS · Set 2 · Computer Science & IT

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.

  1. A.

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

  2. B.

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

  3. C.

    (0∗(1(01∗0)∗1)∗)∗(0^*(1(01^*0)^*1)^*)^*

  4. D.

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

Attempted by 151 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…