arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1702.07388cs.FL
收藏

论语言接受者的存储语言

On Store Languages of Language Acceptors

Oscar H. Ibarra, Ian McQuillan

摘要:

众所周知,每个下推自动机的“存储语言”--可以作为接受计算的中间步骤出现的一组存储配置(状态和堆栈内容)--是一种正则语言。在这里,许多模型的语言接受者与各种数据结构的检查,随着他们的存储语言的研究。对于每个模型,都试图找到接受其存储语言的最简单模型。单向和双向机器的存储语言之间的一些连接通常会被证明,就像非确定性和确定性机器之间的连接一样。还介绍了这些存储语言结果的一个很好的应用,展示了一种通用技术,用于证明许多确定性模型所接受的族在与正则语言的右商下是封闭的,解决了文献中的一些悬而未决的问题(并显着简化了其他已知问题的证明)。对于非正则语言,给出了识别存储语言的空间复杂度的下界。

英文摘要:

It is well known that the "store language" of every pushdown automaton -- the set of store configurations (state and stack contents) that can appear as an intermediate step in accepting computations -- is a regular language. Here many models of language acceptors with various data structures are examined, along with a study of their store languages. For each model, an attempt is made to find the simplest model that accepts their store languages. Some connections between store languages of one-way and two-way machines generally are demonstrated, as with connections between nondeterministic and deterministic machines. A nice application of these store language results is also presented, showing a general technique for proving families accepted by many deterministic models are closed under right quotient with regular languages, resolving some open questions (and significantly simplifying proofs for others that are known) in the literature. Lower bounds on the space complexity for recognizing store languages for the languages to be non-regular are obtained.

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

↑