The Equivalent Conversion between Regular Grammar and Finite Automata

• 作者: Jielan Zhang Zhongsheng Qian
• 来源期刊: 软件工程与应用(英文)
• 学科: 数学
• 关键词: REGULAR GRAMMAR FINITE AUTOMATA NFA DFA
• 年，卷（期）: rjgcyyyyw_2013,（1）
• 页码范围: 33-37
• 页数: 5页
• 分类号: O1

摘要

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.