For eg, if q2 was the only state where 0011 could terminate, then the answer will be {q2} or {q0,q1,q2}?

20 votes

Consider the finite automaton in the following figure:

What is the set of reachable states for the input string $0011$?

- $\{q_0,q_1,q_2\}$
- $\{q_0,q_1\}$
- $\{q_0,q_1,q_2,q_3\}$
- $\{q_3\}$

33 votes

1

@Praveen Saini Sir, can we also convert it to DFA and check, well, I did convert to DFA and found out that string 0011 end up in state {q0 q1 q2} I just want to confirm can we convert NFA to DFA and check it?

0

@praveen

1.How to tackle this type of problem.

2.why not Q3 is considered as it is the final state as any string accepted by automata must end up at final state.

Please suggest

Thanks

1.How to tackle this type of problem.

2.why not Q3 is considered as it is the final state as any string accepted by automata must end up at final state.

Please suggest

Thanks

0 votes

*q*0,*q*1 and *q*2 are reachable from *q*0 on input 0011.

hence, reachable states={q0,q1,q2}. Option A is correct.

0 votes

0 votes

{q0 , 0 → q0} , { q0 , 0 → q0 }, {q0 , 1 → q0}, {q0 , 1 → q1} . Hence δ (q0, 0011) = q1

{q0 , 0 → q0} , { q0 , 0 → q0 }, {q0 , 1 → q1}, {q1 , 1 → q2} . Hence δ (q0, 0011) = q2

**Hence δ (q0, 0011) = {q0, q1, q2}**