Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Finite Automata
In the ε-NFA, M = ({q0, q1, q2, q3}, {a}, δ, q0, {q3}) where 'δ' is given in the transition table below, what is the minimum length of string to reach to the final state?
| ε | a | |
| q0 | {q1} | {} |
| q1 | {q2} | {} |
| q2 | {} | {q2, q3} |
| q3 | {} | {} |
1
0
2
1
3
2
4
3