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
Answer: (C)
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
Article Tags :
Recommended Articles