PS : L1 also accepts.

Dark Mode

12,700 views

47 votes

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?

- $L1 = L2$
- $L1 \subset L2$
- $L2 \subset L1$
- None of the above

76 votes

Best answer

0

20 votes

convert this nfa to dfa , you will get the dfa with same final states for both the cases , so option A is correct

7 votes

@Abhishek Tank how do you know after converting nfa to dfa that state yz represents y only and state xyz represents state z of nfa ???

0