R. E. Stearns and H. B. Hunt III, “On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata,” SIAM Journal on Computing, Vol. 14, No. 3, 1985, pp. 598-611. doi:10.1137/0214044

has been cited by the following article:

• TITLE: The Equivalent Conversion between Regular Grammar and Finite Automata

  AUTHORS: Jielan Zhang, Zhongsheng Qian

  KEYWORDS: Regular Grammar; Finite Automata; NFA, DFA

  JOURNAL NAME: Journal of Software Engineering and Applications, Vol.6 No.1, January 30, 2013

  ABSTRACT: The equivalence exists between regular grammar and finite automata in accepting languages. Some complicated conversion algorithms have also been in existence. The simplified forms of the algorithms and their proofs are given. And the construction algorithm 5 of the equivalent conversion from finite automata to left linear grammar is presented as well as its correctness proof. Additionally, a relevant example is expounded.