Consider the finite automaton in the following figure. What is the set of…
2014
Consider the finite automaton in the following figure.
What is the set of reachable states for the input string 0011 ?
- A.
\(\{q_0,q_1,q_2 \}\) - B.
\(\{q_0,q_1\}\) - C.
\(\{q_0,q_1,q_2, q_3 \}\) - D.
\(\{q_3 \}\)
Attempted by 175 students.
Show answer & explanation
Correct answer: A
Key insight: identify the accepting state(s) and exclude them if the question asks for non-accepting states.
Step 1: Identify accepting states from the diagram. q3 is shown with a double circle, so q3 is the accepting state.
Step 2: List all states: q0, q1, q2, q3.
Step 3: Exclude the accepting state(s) to get the non-accepting states: q0, q1, q2.
Therefore the correct set is {q0, q1, q2}.
A video solution is available for this question — log in and enroll to watch it.