The minimum number of states required for a DFA to accept even parity (strings…

2026

The minimum number of states required for a DFA to accept even parity (strings with even number of 1's over the alphabet {0,1} is

Answer: B. 2 — The minimum number of states required for a DFA to accept even parity (strings with even number of 1's over the alphabet {0,1}) is 2.

  1. A.

    1

  2. B.

    2

  3. C.

    3

  4. D.

    4

Attempted by 118 students.

Show answer & explanation

Correct answer: B

The minimum number of states required for a DFA to accept even parity (strings with even number of 1's over the alphabet {0,1}) is 2.

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…