Journal of Software Engineering and Applications

Vol.6 No.1(2013), Paper ID 27481, 5 pages

DOI:10.4236/jsea.2013.61005

 

The Equivalent Conversion between Regular Grammar and Finite Automata

 

Jielan Zhang, Zhongsheng Qian

 

Department of Information Technology, Yingtan Vocational and Technical College, Yingtan, China
School of Information Tech- nology, Jiangxi University of Finance and Economics, Nanchang, China.

 

Copyright © 2013 Jielan Zhang, Zhongsheng Qian et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

 

How to Cite this Article


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 © 2024 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.