Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Finite Automata
The finite state machine given in figure below recognizes :
1
any string of odd number of a’s
2
any string of odd number of b’s
3
any string of even number of a’s and odd number of b’s
4
any string of odd number of a’s and odd number of b’s