Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Finite Automata
Finite state machine can recognize language generated by ________.
1
Only context free grammar
2
Only context sensitive grammar
3
Only regular grammar
4
any unambiguous grammar