arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.11488cs.FL
收藏

无限词上的可逆转换器

Reversible Transducers over Infinite Words

Luc Dartois, Paul Gastin, Loïc Germerie Guizouarn, R. Govind, Shankaranarayanan Krishna

AI总结:

本文引入无限词上的可逆双向转换器类,证明其表达能力与确定性双向转换器相同,并证明其组合仅需多项式复杂度,为无限词转换器的高效组合提供了理论基础。

摘要:

确定性双向转换器刻画了正则函数类。双向转换器组合的效率在反应式综合相关的算法问题中具有直接意义,其中转换规范被转换为等价的转换器。这些规范以模块化方式呈现,组合所得机器即可模拟完整规范。Dartois等人给出的一项重要结果表明,当底层转换器是可逆的,即它们同时是确定性和共确定性的,双向转换器的组合具有多项式复杂度。这是对一般确定性双向转换器的重大改进,因为一般情形下组合会导致输入规模的双指数爆炸。此外,他们还证明了可逆双向转换器与确定性双向转换器具有相同的表达能力。然而,可逆转换器在无限词上的表达能力问题仍然悬而未决。在本文中,我们引入了无限词上的可逆双向转换器类,并证明它们具有与无限词上的确定性双向转换器相同的表达能力。这一结果通过一个非平凡的、有效的构造实现,该构造在状态集合上引起单指数爆炸。进一步地,我们还证明了组合两个无限词上的可逆双向转换器仅产生多项式复杂度,从而为无限词上转换器组合的高效过程奠定了基础。

英文摘要:

Deterministic two-way transducers capture the class of regular functions. The efficiency of composing two-way transducers has a direct implication in algorithmic problems related to reactive synthesis, where transformation specifications are converted into equivalent transducers. These specifications are presented in a modular way, and composing the resultant machines simulates the full specification. An important result by Dartois et al. shows that composition of two-way transducers enjoy a polynomial composition when the underlying transducer is reversible, that is, if they are both deterministic and co-deterministic. This is a major improvement over general deterministic two-way transducers, for which composition causes a doubly exponential blow-up in the size of the inputs in general. Moreover, they show that reversible two-way transducers have the same expressiveness as deterministic two-way transducers. However, the question of expressiveness of reversible transducers over infinite words is still open. In this article, we introduce the class of reversible two-way transducers over infinite words and show that they enjoy the same expressive power as deterministic two-way transducers over infinite words. This is done through a non-trivial, effective construction inducing a single exponential blow-up in the set of states. Further, we also prove that composing two reversible two-way transducers over infinite words incurs only a polynomial complexity, thereby providing foundations for efficient procedure for composition of transducers over infinite words.

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

↑