EQUIVALENCE OF REGULAR GRAMMARS AND FINITE-STATE ACCEPTORS The equivalence of regular grammars and finite-state acceptors is shown in this section. First, a method for constructing an NFA from a regular grammar is given. Then a way of converting a DFA to a regular grammar is illustrated, completing the proof that the languages accepted by finite-state […]