Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
What is the minimum number of states required to the finite automaton equivalent to the transition diagram given below?
1
3
2
4
3
5
4
6