ON TRANSDUCTIONS OF FORMAL POWER-SERIES OVER COMPLETE SEMIRINGS

被引：3

作者：

KARNER, G

机构：

[1] Alcatel Austria-Elin Forschungszentrum, A-1210 Wien

来源：

THEORETICAL COMPUTER SCIENCE | 1992年 / 98卷 / 01期

关键词：

D O I：

10.1016/0304-3975(92)90377-R

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Rational and pushdown transductions of formal languages are generalized to formal power series with coefficients in a complete semiring. A characterization similar to Nivat's Theorem is given. Commutativity requirements for the coefficients are especially studied.

引用

页码：27 / 39

页数：13

共 12 条

[1]

Conway J. H., 1971, REGULAR ALGEBRA FINI

[2]

Eilenberg S., 1974, AUTOMATA LANGUAGES M, VA

[3]

GOLDSTERN M, 1986, THESIS TU WIEN

[4] NIVAT THEOREM FOR PUSHDOWN TRANSDUCERS [J].

KARNER, G .

THEORETICAL COMPUTER SCIENCE, 1992, 97 (02) :245-262

[5]

KARNER G, IN PRESS SEMIGROUP F

[6]

KARNER G, 1986, THESIS TU WIEN

[7] MONOIDS AND CONTINUOUS SEMI-RINGS [J].

KROB, D .

SEMIGROUP FORUM, 1988, 37 (01) :59-78

[8] AUTOMATA AND LANGUAGES GENERALIZED TO OMEGA-CONTINUOUS SEMIRINGS [J].

KUICH, W .

THEORETICAL COMPUTER SCIENCE, 1991, 79 (01) :137-150

[9]

KUICH W, 1987, LNCS, V267, P212

[10]

Kuich W., 1986, SEMIRINGS AUTOMATA L

← 1 2 →