arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1802.02094cs.FL
收藏

正则变换的正则转换器表达式

Regular Transducer Expressions for Regular Transformations

Vrunda Dave, Paul Gastin, Krishna Shankara Narayanan

摘要:

功能性MSO传感器、确定性双向传感器以及流弦传感器都是常规功能的等效模型。在本文中,我们表明,每一个正规的功能,无论是有限字或无限字,捕获的确定性双向换能器,可以描述与常规换能器表达式(RTE)。对于无限字,传感器使用Muller接受和$ω$ -常规前瞻。\RTEs是从常数函数使用组合子if-then-else(确定性选择),Hadamard产品,和明确版本的柯西产品,2链Kleene迭代和2链Ω迭代。我们的证明适用于有限字和无限字的变换,扩展了Besar等人关于有限字的结果。在LICS'14。为了构建一个RTE与确定性的双向Muller传感器与前瞻,我们介绍了过渡幺半群的概念,这种双向传感器的前瞻是由一些向后确定性Büchi自动机捕获。然后,我们使用一个明确的版本Imre西蒙著名的森林因子分解定理,以获得一个“好”($ω$ -)的域的双向换能器的正则表达式。“好”表达式是明确的,Kleene-plus和$ω$ -迭代只用于与转换幺半群的\emph{idempotent}元素对应的子表达式。组合子表达式最后构造的“好”($ω$ -)的正则表达式描述的域的传感器上的结构归纳。

英文摘要:

Functional MSO transductions, deterministic two-way transducers, as well as streaming string transducers are all equivalent models for regular functions. In this paper, we show that every regular function, either on finite words or on infinite words, captured by a deterministic two-way transducer, can be described with a regular transducer expression (RTE). For infinite words, the transducer uses Muller acceptance and $ω$-regular look-ahead. \RTEs are constructed from constant functions using the combinators if-then-else (deterministic choice), Hadamard product, and unambiguous versions of the Cauchy product, the 2-chained Kleene-iteration and the 2-chained omega-iteration. Our proof works for transformations of both finite and infinite words, extending the result on finite words of Alur et al.\ in LICS'14. In order to construct an RTE associated with a deterministic two-way Muller transducer with look-ahead, we introduce the notion of transition monoid for such two-way transducers where the look-ahead is captured by some backward deterministic Büchi automaton. Then, we use an unambiguous version of Imre Simon's famous forest factorization theorem in order to derive a "good" ($ω$-)regular expression for the domain of the two-way transducer. "Good" expressions are unambiguous and Kleene-plus as well as $ω$-iterations are only used on subexpressions corresponding to \emph{idempotent} elements of the transition monoid. The combinator expressions are finally constructed by structural induction on the "good" ($ω$-)regular expression describing the domain of the transducer.

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

↑