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.
For the above finite state automaton the equivalent minimum state automaton has the following number of states
1
3
2
4
3
2
4
1