Weighted two-way transducers

IF 0.8 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Information and Computation Pub Date : 2023-09-22 DOI:10.1016/j.ic.2023.105094

Fan Feng, Andreas Maletti

引用次数: 0

Abstract

Weighted two-way transducers over complete commutative semirings are introduced and investigated. Their computed mappings have two-way definable support. Conversely, for every two-way definable relation R there exists a mapping that has support R and is computable by a weighted two-way transducer. The class of all such computed mappings is naturally closed under sum. Finally, both the subclass computed by deterministic weighted two-way transducers and the subclass computed by unambiguous weighted two-way transducers are shown to be closed under composition, pseudo Hadamard product, unambiguous Cauchy product, and unambiguous Kleene iteration.

查看原文本刊更多论文

加权双向换能器

引入并研究了完全交换半环上的加权双向变换器。它们的计算映射具有双向可定义的支持。相反，对于每个双向可定义关系R，都存在一个支持R的映射，并且可以通过加权双向转换器计算。所有此类计算映射的类在sum下自然是闭的。最后，证明了由确定性加权双向变换器计算的子类和由无模糊加权双向变换子计算的子类别在组合、伪Hadamard乘积、无模糊Cauchy乘积和无模糊Kleene迭代下是封闭的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information and Computation 工程技术-计算机：理论方法

CiteScore

2.30

自引率

0.00%

发文量

119

审稿时长

140 days

期刊介绍： Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as -Biological computation and computational biology- Computational complexity- Computer theorem-proving- Concurrency and distributed process theory- Cryptographic theory- Data base theory- Decision problems in logic- Design and analysis of algorithms- Discrete optimization and mathematical programming- Inductive inference and learning theory- Logic & constraint programming- Program verification & model checking- Probabilistic & Quantum computation- Semantics of programming languages- Symbolic computation, lambda calculus, and rewriting systems- Types and typechecking