The minimum number of states required for DFA to accept binary strings that…

2026

The minimum number of states required for DFA to accept binary strings that are divisible by 3 is

Answer: C. 3 — The minimum number of states required for DFA to accept binary strings that are divisible by 3 is 3.

  1. A.

    1

  2. B.

    2

  3. C.

    3

  4. D.

    4

Attempted by 228 students.

Show answer & explanation

Correct answer: C

The minimum number of states required for DFA to accept binary strings that are divisible by 3 is 3.

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…