Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time

被引：4

作者：

Boiret, Adrien ^{[1
]}

Palenta, Raphaela ^{[2
]}

机构：

[1] Univ Lille 1, CRIStAL, Ave Carl Gauss, F-59655 Villeneuve Dascq, France

[2] Tech Univ Munich, Dept Informat, Boltzmannstr 3, D-85748 Garching, Germany

来源：

DEVELOPMENTS IN LANGUAGE THEORY, DLT 2016 | 2016年 / 9840卷

关键词：

Tree transducer; Deciding equivalence; Partial normal form;

D O I：

10.1007/978-3-662-53132-7_29

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We show that the equivalence of linear top-down tree-to-word transducers is decidable in polynomial time. Linear tree-to-word transducers are non-copying but not necessarily order-preserving and can be used to express XML and other document transformations. The result is based on a partial normal form that provides a basic characterization of the languages produced by linear tree-to-word transducers.

引用

页码：355 / 367

页数：13

共 50 条

[21] A polynomial algorithm for deciding the validity of an electrical distribution tree
Barth, Dominique
Mautor, Thierry
Watel, Dimitri
Weisser, Marc-Antoine
[J]. INFORMATION PROCESSING LETTERS, 2022, 176
[22] The equivalence problem for deterministic MSO tree transducers is decidable
Engelfriet, Joost
Maneth, Sebastian
[J]. INFORMATION PROCESSING LETTERS, 2006, 100 (05) : 206 - 212
[23] DECIDABILITY OF EQUIVALENCE FOR A CLASS OF NONDETERMINISTIC TREE-TRANSDUCERS
ANDRE, Y
DAUCHET, M
[J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1994, 28 (05): : 447 - 463
[24] The equivalence problem for deterministic MSO tree transducers is decidable
Engelfriet, J
Maneth, S
[J]. FSTTCS 2005: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2005, 3821 : 495 - 504
[25] Sieve Method for Polynomial Linear Equivalence
Wang, Baocang
Hu, Yupu
[J]. JOURNAL OF APPLIED MATHEMATICS, 2013,
[26] Deciding the FIFO stability of networks in polynomial time
Weinard, Maik
[J]. ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2006, 3998 : 81 - 92
[27] Deciding multiple tiling by polygons in polynomial time
Kolountzakis, Mihail N.
[J]. PERIODICA MATHEMATICA HUNGARICA, 2021, 83 (01) : 32 - 38
[28] Deciding multiple tiling by polygons in polynomial time
Mihail N. Kolountzakis
[J]. Periodica Mathematica Hungarica, 2021, 83 : 32 - 38
[29] A POLYNOMIAL-TIME ALGORITHM FOR DECIDING THE EQUIVALENCE PROBLEM FOR 2-TAPE DETERMINISTIC FINITE STATE ACCEPTORS
FRIEDMAN, EP
GREIBACH, SA
[J]. SIAM JOURNAL ON COMPUTING, 1982, 11 (01) : 166 - 183
[30] Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
Danicic, Sebastian
Harman, Mark
Hierons, Rob
Howroyd, John
Laurence, Michael R.
[J]. THEORETICAL COMPUTER SCIENCE, 2007, 373 (1-2) : 1 - 18

← 1 2 3 4 5 →