edited by
16,108 views
53 votes
53 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?

  1. $L1 = L2$
  2. $L1 \subset L2$
  3. $L2 \subset L1$
  4. None of the above
edited by

4 Answers

Best answer
82 votes
82 votes

Misprints : Edge $Y \rightarrow Z$ ( $0$ edge )
                   Edge $Z \rightarrow Y$ ( $1$ edge )

Answer: A.

Explanation:

Writing $Y$ and $Z$ in terms of incoming arrows (Arden's method) :

$Y = X0 + Y0 + Z1$

$Z = X0 + Z1 + Y0$

Hence $Y=Z$. So, option (A).

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

converting NFA to DFA,

both DFAs are same so,L1=L2

1 votes
1 votes

Nice Explanation GFg

P.s Different ans due to  different assumption.

edited by
Answer:

Related questions