无限字的可计算正则函数的综合
Synthesis of Computable Regular Functions of Infinite Words
AI总结:
本文针对正则函数的可计算性综合问题,证明正则函数的可计算性等价于连续性,建立连续性通用刻画,证明有理与正则函数的可计算性可判定,其中有理函数可在NLogSpace内判定,还刻画了一致连续性并关联一致可计算性。
摘要:
从无限字到无限字的正则函数可以由MSO转换器(即单二阶逻辑转换器)、流式$\omega$-字符串转换器以及带前瞻的确定性双向转换器等价刻画。在单向限制下,后一类转换器定义了有理函数类。尽管正则函数可由多种有限状态装置给出稳健的刻画,但即便是有理函数这一子类,也可能包含(由处理无限输入的图灵机)不可计算的函数。本文针对如下综合问题提出了一种判定过程:给定一个正则函数$f$(由上述任意一种转换器模型等价给出),判断$f$是否可计算,若可计算则综合出计算它的图灵机。\n 对于正则函数,我们证明了可计算性等价于连续性,因此该问题可归结为判定连续性。我们对逆像下保持正则语言的函数(例如正则函数)建立了连续性的通用刻画。我们利用这一刻画证明了有理函数与正则函数的连续性(即可计算性)是可判定的。对于有理函数,我们证明该判定可在$\mathsf{NLogSpace}$(非确定对数空间)内完成(此前Prieur已证明该问题属于$\mathsf{PTime}$(多项式时间))。以类似方式,我们还有效刻画了正则函数的一致连续性,并将其与能提供更强效率保证的一致可计算性概念关联起来。
英文摘要:
Regular functions from infinite words to infinite words can be equivalently specified by MSO-transducers, streaming $ω$-string transducers as well as deterministic two-way transducers with look-ahead. In their one-way restriction, the latter transducers define the class of rational functions. Even though regular functions are robustly characterised by several finite-state devices, even the subclass of rational functions may contain functions which are not computable (by a Turing machine with infinite input). This paper proposes a decision procedure for the following synthesis problem: given a regular function $f$ (equivalently specified by one of the aforementioned transducer model), is $f$ computable and if it is, synthesize a Turing machine computing it. For regular functions, we show that computability is equivalent to continuity, and therefore the problem boils down to deciding continuity. We establish a generic characterisation of continuity for functions preserving regular languages under inverse image (such as regular functions). We exploit this characterisation to show the decidability of continuity (and hence computability) of rational and regular functions. For rational functions, we show that this can be done in $\mathsf{NLogSpace}$ (it was already known to be in $\mathsf{PTime}$ by Prieur). In a similar fashion, we also effectively characterise uniform continuity of regular functions, and relate it to the notion of uniform computability, which offers stronger efficiency guarantees.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。