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

GATE · 2005 · IT

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

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?

A.
L1 = L2
B.
L1 ⊂ L2
C.
L2 ⊂ L1
D.
None of the above

Attempted by 174 students.

Show answer

Correct answer: A

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2