Consider the finite automata in the following figure.Which

Home » Theory of Computation » Theory of computation miscellaneous » Question

Consider the finite automata in the following figure.

Which is the set of reachable states for the input string 0011?

1. {q₀, q₁, q₂}
2. {q₀, q₁}
3. {q₀, q₁, q₂, q₃}
4. {q₃}

Correct Option: A

Following paths can be taken by the finite Automata for the input string “0011”:––

We note that no other path is possible for the input string "0011". So, finally union of all three cases gives us the set of Reachable states which is {q₀, q₁, q₂}