The Equivalent Conversion between Regular Grammar and Finite Automata

Journals Menu

Follow SCIRP

ISSN Print: 1945-3116
ISSN Online: 1945-3124
www.scirp.org/journal/jsea
E-mail: jsea@scirp.org

"The Equivalent Conversion between Regular Grammar and Finite Automata"
written by Jielan Zhang, Zhongsheng Qian,
published by Journal of Software Engineering and Applications, Vol.6 No.1, 2013

has been cited by the following article(s):

[1]	Conversion of Deterministic and Non-Deterministic Finite Automata to Regular Expression using Brzozowski Algebraic Method
	International Journal of Scientific and Engineering Research, 2020

[2]	Stochastic Grammars: Not Just for Words!
	2019

[3]	Game AI Pro 360: Guide to Character Behavior
	2019

[4]	Stochastic Grammars
	2019

[5]	A New Algorithm for Determining the Equivalence of Two Finite-State Automata
	2018

[6]	SCOPE OF E-ASSESSMENT OF ANSWERS IN MATHEMATICAL DOMAIN
	International Journal of Civil Engineering and Technology, 2017

[7]	Great Evaluator: An Automated Assessment System for Evaluating Regular Grammars in Automata Theory
	Global Journal of Pure and Applied Mathematics [GJPAM], 2016

[8]	A Novel Method To Construct Deterministic Finite Automata From AGiven Regular Grammar
	2015

[9]	A novel method to construct deterministic finite automata from a given regular grammar
	2015

Follow SCIRP