一元输出卵石换能器
Pebble transducers with unary output
摘要：
Bojaczyk最近开始了对确定性卵石换能器的深入研究，卵石换能器是一种双向自动机，可以在输入单词上留下标记（称为“卵石”），并产生输出单词。它们从一个词到另一个词描述功能。已经研究了该定义的两个自然限制：Douéneau-Tabot等人的大理石换能器，和比较自由卵石换能器（我们在这里重命名为“盲换能器”）的Nguyên等人。在这里，我们研究的可判定性的卵石，大理石和盲换能器，产生一元输出计算的函数类之间的隶属度问题。首先，我们表明，卵石和大理石换能器具有相同的表达能力时，输出是一元（这是假的非一元输出）。然后，我们描述了1卵石传感器与一元输出，描述了一个函数可计算的盲传感器，并表明，隶属度问题是可判定的。这些结果可以用程序的自动化简化来解释。
英文摘要：
Bojańczyk recently initiated an intensive study of deterministic pebble transducers, which are two-way automata that can drop marks (named "pebbles") on their input word, and produce an output word. They describe functions from words to words. Two natural restrictions of this definition have been investigated: marble transducers by Douéneau-Tabot et al., and comparison-free pebble transducers (that we rename here "blind transducers") by Nguyên et al. Here, we study the decidability of membership problems between the classes of functions computed by pebble, marble and blind transducers that produce a unary output. First, we show that pebble and marble transducers have the same expressive power when the outputs are unary (which is false over non-unary outputs). Then, we characterize 1-pebble transducers with unary output that describe a function computable by a blind transducer, and show that the membership problem is decidable. These results can be interpreted in terms of automated simplification of programs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
