Conelikes和Ranker比较
Conelikes and Ranker Comparisons
摘要:
对于每一个固定的正则语言类,都有一个自然的层次结构,越来越多的一般性问题:首先,成员问题询问给定的语言是否属于固定的语言类。第二,分离问题要求两个给定的语言是否可以从固定类的语言分开。第三,覆盖问题是分离问题在两种以上语言中的推广。这类问题的大多数实例都是通过将正则语言与有限幺半群联系起来来解决的。将隶属度问题和分离性问题推广到有序幺半群上。类点的计算可以解释为覆盖问题的代数对应。本文考虑将类点的计算推广到有序幺半群.这导致了相应的代数框架的conelikes的概念。我们将这个框架应用到Trotter-Weil层次结构和$\text{FO}^2$量词交替层次结构的全层和半层。因此,我们解决了覆盖问题的$\mathbf{DA}$的子品种。一个重要的组合工具是统一的秩刻画所有的子品种考虑,这些刻画源于秩位置的顺序比较。
英文摘要:
For every fixed class of regular languages, there is a natural hierarchy of increasingly more general problems: Firstly, the membership problem asks whether a given language belongs to the fixed class of languages. Secondly, the separation problem asks for two given languages whether they can be separated by a language from the fixed class. And thirdly, the covering problem is a generalization of separation problem to more than two given languages. Most instances of such problems were solved by the connection of regular languages and finite monoids. Both the membership problem and the separation problem were also extended to ordered monoids. The computation of pointlikes can be interpreted as the algebraic counterpart of the covering problem. In this paper, we consider the extension the computation of pointlikes to ordered monoids. This leads to the notion of conelikes for the corresponding algebraic framework. We apply this framework to the Trotter-Weil hierarchy and both the full and the half levels of the $\text{FO}^2$ quantifier alternation hierarchy. As a consequence, we solve the covering problem for the resulting subvarieties of $\mathbf{DA}$. An important combinatorial tool are uniform ranker characterizations for all subvarieties under consideration; these characterizations stem from order comparisons of ranker positions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。