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

连续有理函数是确定性正则函数

Continuous rational functions are deterministic regular

Olivier Carton, Gaëtan Douéneau-Tabot

摘要:

一个字到字的函数是有理数的,如果它可以通过一个非确定性的单向换能器来实现。在有限字上,任何有理函数都是正则的,这是一个经典的结果,即它可以由确定性双向转换器计算,或者等价地,由确定性流串转换器(操纵串寄存器的单向自动机)计算。这个结果不再适用于无限的单词,因为非确定性的单向转换器可以猜测,并检查沿着其运行,属性,如无限多次出现的某种模式,这是不可能的确定性机器。在本文中,我们确定类的有理函数在无限的话,这也是可计算的一个确定性的双向换能器。它与连续的有理函数类相一致,因此可以确定这个性质。这解决了一个悬而未决的问题,在以前的论文戴夫等人。

英文摘要:

A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer. Over finite words, it is a classical result that any rational function is regular, i.e. it can be computed by a deterministic two-way transducer, or equivalently, by a deterministic streaming string transducer (a one-way automaton which manipulates string registers). This result no longer holds for infinite words, since a non-deterministic one-way transducer can guess, and check along its run, properties such as infinitely many occurrences of some pattern, which is impossible for a deterministic machine. In this paper, we identify the class of rational functions over infinite words which are also computable by a deterministic two-way transducer. It coincides with the class of rational functions which are continuous, and this property can thus be decided. This solves an open question raised in a previous paper of Dave et al.

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

↑