The equivalence problem for deterministic MSO tree transducers is decidable

被引：0

作者：

Engelfriet, J ^{[1
]}

Maneth, S

机构：

[1] Leiden Univ, LIACS, NL-2300 RA Leiden, Netherlands

[2] Ecole Polytech Fed Lausanne, Fac I&C, CH-1015 Lausanne, Switzerland

来源：

FSTTCS 2005: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS | 2005年 / 3821卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

It is decidable for deterministic MSO definable graph-to-string or graph-to-tree transducers whether they are equivalent on a context-free set of graphs.

引用

页码：495 / 504

页数：10

共 50 条

[1] The equivalence problem for deterministic MSO tree transducers is decidable
Engelfriet, Joost
Maneth, Sebastian
[J]. INFORMATION PROCESSING LETTERS, 2006, 100 (05) : 206 - 212
[2] THE EQUIVALENCE PROBLEM FOR DETERMINISTIC 2-WAY SEQUENTIAL TRANSDUCERS IS DECIDABLE
GURARI, EM
[J]. SIAM JOURNAL ON COMPUTING, 1982, 11 (03) : 448 - 452
[3] Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable
Seidl, Helmut
Maneth, Sebastian
Kemper, Gregor
[J]. 2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2015, : 943 - 962
[4] Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable
Seidl, Helmut
Maneth, Sebastian
Kemper, Gregor
[J]. JOURNAL OF THE ACM, 2018, 65 (04)
[5] A Survey on Decidable Equivalence Problems for Tree Transducers
Maneth, Sebastian
[J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (08) : 1069 - 1100
[6] The equivalence problem for deterministic pushdown automata is decidable
Senizergues, G
[J]. AUTOMATA, LANGUAGES AND PROGRAMMING, 1997, 1256 : 671 - 681
[7] EQUIVALENCE OF FINITE-VALUED TREE-TRANSDUCERS IS DECIDABLE
SEIDL, H
[J]. MATHEMATICAL SYSTEMS THEORY, 1994, 27 (04): : 285 - 346
[8] ON THE EQUIVALENCE PROBLEM FOR DETERMINISTIC MULTITAPE AUTOMATA AND TRANSDUCERS
CULIK, K
KARHUMAKI, J
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 468 - 479
[9] The equivalence problem for deterministic pushdown transducers into abelian groups
Sénizergues, G
[J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998, 1998, 1450 : 305 - 315
[10] THE EQUIVALENCE OF FINITE VALUED TRANSDUCERS (ON HDTOL LANGUAGES) IS DECIDABLE
CULIK, K
KARHUMAKI, J
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 233 : 264 - 272

← 1 2 3 4 5 →