GATE CS 2021 (Afternoon) — Question 57

Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)MSQ2 marksMedium

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.
  1. A
    \((0 + 1(01^*0)^*1)^*\)
  2. B
    \((0 + 11 + 10(1 + 00)^*01)^*\)
  3. C
    \((0^*(1(01^*0)^*1)^*)^*\)
  4. D
    \((0 + 11 + 11(1 + 00)^*00)^*\)
Practise the full 2021-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Automata Theory (Hopcroft & Ullman)Regular languages, CFGs, pushdown automata and Turing machines.
Practise more on Regular Expressions & Finite Automata (DFA/NFA Min)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group