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.
After minimization which diagram is correct.
1
2
3
4