Journal of Software Engineering and Applications

Volume 6, Issue 1 (January 2013)

ISSN Print: 1945-3116   ISSN Online: 1945-3124

Google-based Impact Factor: 2.23  Citations  h5-index & Ranking

The Equivalent Conversion between Regular Grammar and Finite Automata

HTML  Download Download as PDF (Size: 190KB)  PP. 33-37  
DOI: 10.4236/jsea.2013.61005    11,544 Downloads   19,704 Views  Citations

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.

Share and Cite:

J. Zhang and Z. Qian, "The Equivalent Conversion between Regular Grammar and Finite Automata," Journal of Software Engineering and Applications, Vol. 6 No. 1, 2013, pp. 33-37. doi: 10.4236/jsea.2013.61005.

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.