Question: fsm can recognize only regular grammar?
Answer: "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. ... 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. "