arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.15899cs.FL
收藏

关于上下文无关语言泵引理的简短综述

A short survey around the pumping lemma for context-free languages

Gabriele Gullà

AI总结:

本文简明且自洽地综述了上下文无关语言(CFL)的主要性质,重点探讨了泵引理(PL)及其生成文法(CFG),并明确将文献中的迭代定理称为Ogden引理,同时省略了无关定义并调整了部分符号以避免混淆。

摘要:

继作者为计算机科学学生的自动机理论课程举办研讨会之后,本文将以非常简练且基本自洽的方式,介绍上下文无关语言(CFL)的主要性质,特别关注泵引理(PL)以及生成它们的文法(CFG)。关于该主题的早期工作,我们参考了Chomsky和Schutzenberger的研究。文献中被称为迭代定理的内容,在此将以完全合理的方式被称为Ogden引理。与上下文无关概念无严格联系的所有定义将被省略(我们将为所有定义提供精确的参考)。所使用的符号基本是经典的,但为了避免与逻辑中使用的符号混淆,我们将替换一些符号。

英文摘要:

Following a seminar the present author gave to an Automata Theory course to computer science students, it will be presented, in a very synthetic and mostly selfcontained way, the principal properties of context free languages (CFL), with particular attention given to the Pumping Lemma (PL), and of grammars which generate them(CFG). We refer to Chomsky and Schutzenberger for the first works about it. What is known in literature as the Iteration Theorem here will be referred to as the Ogden's Lemma in a fully justified way. All definitions not strictly connected with the notion of context freeness will be omitted (we will give precise references for all of them). The symbology used is substantially the classical one, but we will replace some symbols to avoid confusion with those used in logic

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑