With respect to the function,regular grammar is equivalent to finite automata in accepting languages.There exist some equivalent construction algorithms,which are rather complex.

• 在功能上,正规文法与有限自动机描述和识别语言是等价的,它们之间也存在等价构造算法,但这些构造算法有些复杂。