组合无复制流式字符串转换器
Composing Copyless Streaming String Transducers
AI总结:
本文重新审视无复制流式字符串转换器的组合构造,发现原始构造可能产生表面有复制行为,定义无菱形SST子类并给出消除该行为的方法,从而恢复组合封闭性。
摘要:
流式字符串转换器(SSTs)通过单次从左到右的遍历读取每个输入单词,同时在有限的一组字符串变量中维护潜在输出的片段,从而实现字符串到字符串的转换。这些变量在转换器的状态转移过程中被更新,它们可以被赋予由变量和输出符号的拼接所描述的新值。如果一个SST的每次更新都使得所有赋值表达式中没有变量出现超过一次,则该SST被称为无复制的。当限制在字符串图上时,无复制SST所实现的转换与Courcelle的一元二阶逻辑图转换器(MSOTs)一致。已知带非确定性的无复制SST也等价于非确定性MSOTs。\n确定性MSOTs和非确定性MSOTs在组合下都是封闭的。鉴于MSOTs与无复制SSTs的等价性,很容易看出无复制SSTs在组合下也是封闭的。然而,这一事实的原始证明基于一种直接构造方法,从两个给定的无复制SSTs生成一个组合的无复制SST。Joost Englefriet发现的一个反例表明,这种构造可能产生有复制的转换器。我们重新审视了确定性和非确定性SSTs的原始组合构造,并表明尽管它们可能引入有复制的更新,但它们表现出的有复制行为是表面的。为了刻画这种轻微的有复制行为,我们定义了一类有复制SSTs的子类,称为无菱形SSTs,其中公共变量的两个副本在任何后续赋值中都不会被合并。为了恢复原始构造的修改版本,我们提供了一种方法,从任何无菱形的有复制SST生成等价的无复制SST。
英文摘要:
Streaming string transducers (SSTs) implement string-to-string transformations by reading each input word in a single left-to-right pass while maintaining fragments of potential outputs in a finite set of string variables. These variables get updated on transitions of the transducer, where they can be assigned new values described by concatenations of variables and output symbols. An SST is called copyless if every update is such that no variable occurs more than once amongst all of the assigned expressions. The transformations realized by copyless SSTs coincide with Courcelle's monadic second-order logic graph transducers (MSOTs) when restricted to string graphs. Copyless SSTs with nondeterminism are known to be equivalent to nondeterministic MSOTs as well. MSOTs, both deterministic and nondeterministic, are closed under composition. Given the equivalence of MSOTs and copyless SSTs, it is easy to see that copyless SSTs are also closed under composition. The original proof of this fact, however, was based on a direct construction to produce a composite copyless SST from two given copyless SSTs. A counterexample discovered by Joost Englefriet showed that this construction may produce copyful transducers. We revisit the original composition constructions for both deterministic and nondeterministic SSTs and show that, although they can introduce copyful updates, the resulting copyful behavior they exhibit is superficial. To characterize this mild copyful behavior, we define a subclass of copyful SSTs, called diamond-free SSTs, in which two copies of a common variable are never combined in any subsequent assignment. In order to recover a modified version of the original construction, we provide a method for producing an equivalent copyless SST from any diamond-free copyful SST.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。