Let \(L\) be the language represented by the regular expression…

PYQ GATE 2015

Let LL be the language represented by the regular expression Σ∗0011Σ∗Σ^∗0011Σ^∗where Σ={0,1}Σ = \{0, 1\}. What is the minimum number of states in a DFA that recognizes L‾\overline L (complement of LL)?

  1. A.

    4

  2. B.

    5

  3. C.

    6

  4. D.

    8

Attempted by 271 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…