Consider the regular expression (0+1)(0+1)...(0+1), where (0+1) is repeated n…

PYQ GATE 1999

Consider the regular expression (0+1)(0+1)...(0+1), where (0+1) is repeated n times. The minimum-state finite automaton that recognizes the language represented by this regular expression contains:

  1. A.

    n states

  2. B.

    n + 1 states

  3. C.

    n + 2 states

  4. D.

    None of the above

Attempted by 424 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…