当前位置: X-MOL 学术 › Fundam. Inform. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Copyful Streaming String Transducers
Fundamenta Informaticae ( IF 1.166 ) Pub Date : 2021-01-13 , DOI: 10.3233/fi-2021-1998
Emmanuel Filiot 1 , Pierre-Alain Reynier 2
Affiliation  

Copyless streaming string transducers (copyless SST) have been introduced by R. Alur and P. Černý in 2010 as a one-way deterministic automata model to define transductions of finite strings. Copyless SST extend deterministic finite state automata with a set of variables in which to store intermediate output strings, and those variables can be combined and updated all along the run, in a linear manner, i.e., no variable content can be copied on transitions. It is known that copyless SST capture exactly the class of MSO-definable string-to-string transductions, and are as expressive as deterministic two-way transducers. They enjoy good algorithmic properties. Most notably, they have decidable equivalence problem (in PSpace). On the other hand, HDT0L systems have been introduced for a while, the most prominent result being the decidability of the equivalence problem. In this paper, we propose a semantics of HDT0L systems in terms of transductions, and use it to study the class of deterministic copyful SST. Our contributions are as follows:(i)HDT0L systems and total deterministic copyful SST have the same expressive power,(ii)the equivalence problem for deterministic copyful SST and the equivalence problem for HDT0L systems are inter-reducible, in quadratic time. As a consequence, equivalence of deterministic SST is decidable,(iii)the functionality of non-deterministic copyful SST is decidable,(iv)determining whether a non-deterministic copyful SST can be transformed into an equivalent non-deterministic copyless SST is decidable in polynomial time.

中文翻译:

复制流字符串转换器

R. Alur和P.Černý于2010年引入了无复制流串传感器(无复制SST),它是一种用于确定有限串的转换的单向确定性自动机模型。无复制SST通过一组变量来扩展确定性有限状态自动机,在其中存储中间输出字符串,并且这些变量可以线性方式在整个运行过程中进行组合和更新,即,在转换时不能复制任何变量内容。众所周知,无复制SST可以精确捕获MSO定义的字符串到字符串转导的类别,并且与确定性双向换能器一样具有表现力。它们具有良好的算法特性。最值得注意的是,它们具有可判定的对等问题(在PSpace中)。另一方面,HDT0L系统已经引入了一段时间,最突出的结果是等价问题的可判定性。在本文中,我们从转导的角度提出了HDT0L系统的语义,并将其用于研究确定性可复制SST的类别。我们的贡献如下:(i)HDT0L系统和全部确定性复制SST具有相同的表达能力,(ii)确定性复制SST的等价问题和HDT0L系统的等价问题在二次时间内是可约简的。结果,确定性SST的等效性是可确定的,(iii)非确定性可复制SST的功能是可确定的,(iv)确定是否可以将非确定性可复制SST转换为等效的不确定性不可复制SST多项式时间。我们从转导的角度提出了HDT0L系统的语义,并用它来研究确定性可复制SST的类别。我们的贡献如下:(i)HDT0L系统和全部确定性复制SST具有相同的表达能力,(ii)确定性复制SST的等价问题和HDT0L系统的等价问题在二次时间内是可约简的。结果,确定性SST的等效性是可确定的,(iii)非确定性可复制SST的功能是可确定的,(iv)确定是否可以将非确定性可复制SST转换为等效的不确定性不可复制SST多项式时间。我们从转导的角度提出了HDT0L系统的语义,并用它来研究确定性可复制SST的类别。我们的贡献如下:(i)HDT0L系统和全部确定性复制SST具有相同的表达能力,(ii)确定性复制SST的等价问题和HDT0L系统的等价问题在二次时间内是可约简的。结果,确定性SST的等效性是可确定的,(iii)非确定性可复制SST的功能是可确定的,(iv)确定是否可以将非确定性可复制SST转换为等效的不确定性不可复制SST多项式时间。(i)HDT0L系统和全部确定性复制SST具有相同的表达能力,(ii)确定性复制SST的等价问题和HDT0L系统的等价问题在二次时间内是可约简的。结果,确定性SST的等效性是可确定的,(iii)非确定性可复制SST的功能是可确定的,(iv)确定是否可以将非确定性可复制SST转换为等效的不确定性不可复制SST多项式时间。(i)HDT0L系统和全部确定性复制SST具有相同的表达能力,(ii)确定性复制SST的等价问题和HDT0L系统的等价问题在二次时间内是可约简的。结果,确定性SST的等效性是可确定的,(iii)非确定性可复制SST的功能是可确定的,(iv)确定是否可以将非确定性可复制SST转换为等效的不确定性不可复制SST多项式时间。
更新日期:2021-01-15
down
wechat
bug