Consider the non-deterministic finite automaton (NFA) shown in the figure.…

PYQ GATE 2005

Consider the non-deterministic finite automaton (NFA) shown in the figure.

image.png

State X is the starting state of the automaton. Let the language accepted by the NFA with Y as the only accepting state be L1. Similarly, let the language accepted by the NFA with Z as the only accepting state be L2. Which of the following statements about L1 and L2 is TRUE?

  1. A.

    L1 = L2

  2. B.

    L1 ⊂ L2

  3. C.

    L2 ⊂ L1

  4. D.

    None of the above

Attempted by 230 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…