In the ε-NFA M = ({q0, q1, q2, q3}, {a}, δ, q0, {q3}) with δ: q0 –ε→ q1, q1 –ε→ q2, q2 –a→ {q2, q3}, and no other moves, what is the minimum length of a string that reaches the final state?

1. A0
2. B1
3. C2
4. D3

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: B. 1

Explanation

From q0 the ε-moves reach q2 without input; one a then reaches q3. Minimum length = 1.