Consider the regular language L = (111 + 11111)*. The minimum number of states…

PYQ GATE 2006

Consider the regular language L = (111 + 11111)*. The minimum number of states in any DFA accepting this languages is:

  1. A.

    3

  2. B.

    5

  3. C.

    8

  4. D.

    9

Attempted by 222 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…