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

Expregular函数

Expregular functions

CNRS, IRIF, Université Paris Cité, France(法国国家科学研究中心,IRIF,巴黎西岱大学);LIS, Université Aix-Marseille, France(法国国家科学研究中心,LIS,艾克斯-马赛大学)

Thomas Colcombet, Nathan Lhote, Pierre Ohlmann

AI总结:

本研究提出具有指数增长性的expregular函数类,给出MSO集合解释、yield-Hennie机、Ariadne转换器三种等价模型,证明其正则反射性并解决自动结构相关猜想。

摘要:

正如Bojanczyk(2018)所证实的,多正则函数(polyregular functions)是一类具有多项式增长性的稳健字符串到字符串函数类。该类函数有多种描述方式,且具备若干封闭性性质。最值得注意的是,多正则函数具有正则反射性(即正则语言的逆像仍是正则的)。在本研究中,我们提出了一类具有指数增长性的稳健字符串到字符串函数类,将其命名为expregular函数。我们考虑了以下三种用于描述这类函数的模型:一是MSO集合解释(MSO set interpretations),它扩展了MSO解释(刻画多正则函数的模型之一),以单元变量而非一阶变量元组为操作对象;二是yield-Hennie机,即具有有界访问限制的分支单带图灵机;三是Ariadne转换器(Ariadne transducers),这是一种新型的带有限制访问约束的双向下推机模型。我们的核心贡献是实现了从MSO集合解释到yield-Hennie机的转换,而已知yield-Hennie机具有正则反射性(Dartois、Nguyễn、Peyrat 2026)。这一结果尤其证明了MSO集合解释具有正则反射性,进而解决了关于自动结构的一个重要猜想:每个自动ω-字都具有可判定的MSO理论。yield-Hennie机可直接转换为Ariadne转换器,而我们的第二项贡献是证明Ariadne转换器也可转换为MSO集合解释,从而确立了三种模型的等价性。这一等价性是通过证明Ariadne自动机——与Ariadne转换器对应的自动机模型——可识别正则语言得到的。

英文摘要:

Polyregular functions form a robust class of string-to-string functions with polynomial growth, as evidenced by Bojanczyk (2018). This class admits numerous descriptions and enjoys several closure properties. Most notably, polyregular functions are regularity reflecting (\ie the inverse image of a regular language is regular). In this work, we propose a robust class of string-to-string functions with exponential growth which we call expregular functions. We consider the following three models for describing them: - MSO set interpretations, which extend MSO interpretations (one of the models capturing polyregular functions), by operating on monadic variables instead of tuples of first-order variables; - yield-Hennie machines, which are branching one-tape Turing machines with bounded visit; and - Ariadne transducers, a new model of 2-way pushdown machines with a bounded visit restriction. Our main contribution is a translation from MSO set interpretations to yield-Hennie machines, which are known to be regularity reflecting (Dartois, Nguy\~{ê}n, Peyrat 2026). In particular this establishes that MSO set interpretations are regularity reflecting, which in turn settles a major conjecture about automatic structures: every automatic $ω$-word has a decidable MSO theory. Yield-Hennie machine directly translate to Ariadne transducers, and our second contribution is to prove that Ariadne transducers also translate to MSO set interpretations, thus establishing the equivalence of the three models. This is obtained by showing that Ariadne automata -- the automaton model corresponding to Ariadne transducers -- recognise regular languages.

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

↑