FSM can recognize a) Any grammar b)Only CFG c)Any unambiguous grammar d)Only regular grammar
Answers
Answered by
0
"In theory part of computer science subject, FSM theory is the subject of sophisticated machines and dilemmas they are capable of sorting out the kind of problems.
This theory is intimately related to the formal language theory as the class of official often classifies the these.
FSM Can recognize only regular grammar.
That's the only reasons behind the grammars are defined as regular if there is an FSM that can recognize them. "
Similar questions