操作符先后次序ω-语言
Operator Precedence ω-languages
摘要：
ω-语言现在变得越来越重要，因为大多数应用程序都是“不断运行”的。最近的文献，主要是在扩大模型检验技术的应用的动机下，扩展了这些语言的分析从简单的常规的各种类的语言与“可见的语法结构”，如可见的下推语言（VPL）。相反，操作符先后次序语言（OPL）最初被定义为支持确定性分析，虽然看似无关，但与这些语言类别表现出有趣的关系：OPL严格包括VPL，享有所有相关的闭包属性，并以合适的自动机家族和逻辑符号为特征。本文介绍了操作符先后次序ω-语言（ω OPL），研究了各种接受准则及其闭包性质。虽然有些属性是正则语言的自然扩展，但其他属性需要新的研究技术。面向应用程序的例子显示了ωOPLs w.r.t.提供的表达性和可验证性的增益。小班。
英文摘要：
ω-languages are becoming more and more relevant nowadays when most applications are 'ever-running'. Recent literature, mainly under the motivation of widening the application of model checking techniques, extended the analysis of these languages from the simple regular ones to various classes of languages with 'visible syntax structure', such as visibly pushdown languages (VPLs). Operator precedence languages (OPLs), instead, were originally defined to support deterministic parsing and, though seemingly unrelated, exhibit interesting relations with these classes of languages: OPLs strictly include VPLs, enjoy all relevant closure properties and have been characterized by a suitable automata family and a logic notation. In this paper we introduce operator precedence ω-languages (ωOPLs), investigating various acceptance criteria and their closure properties. Whereas some properties are natural extensions of those holding for regular languages, others required novel investigation techniques. Application-oriented examples show the gain in expressiveness and verifiability offered by ωOPLs w.r.t. smaller classes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
