摘要
在功能上,正规文法与有限自动机描述和识别语言是等价的,它们之间也存在等价构造算法,但这些构造算法有些复杂。对其算法进行了简化且给以了证明,并提出了一个从有限自动机构造等价左线性正规文法的算法,同时也进行了证明,最后给出了该算法的一个实例。
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. The simplified forms of the constructions and their proofs are presented. A construction about the equivalent transformation from finite automata to left linear regular grammar is also provided and preyed. A relevant example is given.
出处
《计算机应用与软件》
CSCD
北大核心
2008年第6期110-112,共3页
Computer Applications and Software
作者简介
钱忠胜，讲师，主研领域：软件形式化、计算机算法研究。
