上下文无关文法的有限有向图表示
A representation of context-free grammars with the help of finite digraphs
摘要：
对于任何上下文无关文法，我们建立了一个转换图，即一个有限的有向图与标记弧，它描述了工作的文法。这种方法是新的，它不同于以前已知的图模型。我们定义的概念，适当的步行在这个过渡图，我们证明了一个词属于一个给定的上下文无关的语言，当且仅当这个词可以得到一个适当的步行的帮助。
英文摘要：
For any context-free grammar, we build a transition diagram, that is, a finite directed graph with labeled arcs, which describes the work of the grammar. This approach is new, and it is different from previously known graph models. We define the concept of proper walk in this transition diagram and we prove that a word belongs to a given context-free language if and only if this word can be obtained with the help of a proper walk.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
