Consider the NFA M shown below. Let the language accepted by M be L. Let L1 be…

PYQ GATE 2003

Consider the NFA M shown below.

image.png

Let the language accepted by M be L. Let L1 be the language accepted by the NFA M1 obtained by changing the accepting state of M to a non-accepting state and by changing the non-accepting states of M to accepting states. Which of the following statements is true ?

  1. A.

    L1 = {0, 1}* - L

  2. B.

    L1 = {0, 1}*

  3. C.

    L1 ⊆ L

  4. D.

    L1 = L

Attempted by 286 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…