论文标题
在无上下文语言的某些表示
On some representations of context-free languages
论文作者
论文摘要
无上下文的语言被广泛用于描述编程语言和自然语言的语法。通常，我们借助于无上下文的语法（用于生成）或下降自动机（用于识别）来描述一种无上下文的语言。这项研究的目的是描述一些无上下文语言描述的非常规的方法，即借助有限的digraphs和自动机 - 无上下文语言的生成器。我们将主要关注这些表示的数学模型。
Context-free languages are widely used to describe the syntax of programming languages and natural languages. Usually, we describe a context-free language mathematically with the help of context-free grammar (for generation) or pushdown automata (for recognition). The purpose of this study is to describe some unconventional methods of description of context-free languages, namely a representation with the help of finite digraphs and with automata - generators of context-free languages. We will mainly focus on the mathematical models of these representations.
