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

字符串到上下文转换器的顺序性

Sequentiality of String-to-Context Transducers

Pierre-Alain Reynier, Didier Villevalois

摘要:

transducers扩展了有限状态自动机的输出,并描述了从字符串到字符串的转换。顺序传感器,其具有关于其输入的确定性行为,是特别感兴趣的。然而,与有限状态自动机不同的是,不是每个传感器都可以按顺序进行。Choffrut的开创性工作允许在功能性单向换能器中添加允许等效顺序换能器的换能器。在这项工作中,我们将Choffrut的结果扩展到一类换能器,通过同时添加,在每个过渡,左边的字符串和右边的字符串产生到目前为止,产生输出字符串。我们称之为字符串到上下文转换器。我们得到一个多特征的功能字符串上下文换能器承认一个等效的顺序,基于Lipschitz属性的换能器实现的功能,并在一个模式(一个新的孪生属性)。最后,我们证明,给定一个字符串上下文转换器,确定是否存在一个等价的顺序是在coNP。

英文摘要:

Transducers extend finite state automata with outputs, and describe transformations from strings to strings. Sequential transducers, which have a deterministic behaviour regarding their input, are of particular interest. However, unlike finite-state automata, not every transducer can be made sequential. The seminal work of Choffrut allows to characterise, amongst the functional one-way transducers, the ones that admit an equivalent sequential transducer. In this work, we extend the results of Choffrut to the class of transducers that produce their output string by adding simultaneously, at each transition, a string on the left and a string on the right of the string produced so far. We call them the string-to-context transducers. We obtain a multiple characterisation of the functional string-to-context transducers admitting an equivalent sequential one, based on a Lipschitz property of the function realised by the transducer, and on a pattern (a new twinning property). Last, we prove that given a string-to-context transducer, determining whether there exists an equivalent sequential one is in coNP.

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

↑