Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Finite Automata
Comprehension Passage
The figure displayed below represents a finite state automaton.
Which state is an unreachable state in a given finite state automaton?
1
q0
2
q1
3
q3
4
q2