Finite state machine can recognize language generated by __________.
(A) Only context free grammar
(B) Only context sensitive grammar
(C) Only regular grammar
(D) any unambiguous grammar
Explanation: Finite state machine can recognize language generated by regular grammar only.
For detailed information Refer:Designing Finite Automata from Regular Expression
So, option (C) is correct option.
Quiz of this Question
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.