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 条

[1] Normal Form on Linear Tree-to-Word Transducers
Boiret, Adrien
[J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, LATA 2016, 2016, 9618 : 439 - 451
[2] On the Balancedness of Tree-to-Word Transducers
Loebel, Raphaela
Luttenberger, Michael
Seidl, Helmut
[J]. DEVELOPMENTS IN LANGUAGE THEORY, DLT 2020, 2020, 12086 : 222 - 236
[3] On the Balancedness of Tree-to-Word Transducers
Loebel, Raphaela
Luttenberger, Michael
Seidl, Helmut
[J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2021, 32 (06) : 761 - 783
[4] Learning Sequential Tree-to-Word Transducers
Laurence, Gregoire
Lemay, Aurelien
Niehren, Joachim
Staworko, Slawek
Tommasi, Marc
[J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014), 2014, 8370 : 490 - 502
[5] Normalization of Sequential Top-Down Tree-to-Word Transducers
Laurence, Gregoire
Lemay, Aurelien
Niehren, Joachim
Staworko, Slawek
Tommasi, Marc
[J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2011, 6638 : 354 - 365
[6] TREE EQUIVALENCE OF LINEAR RECURSIVE SCHEMATA IS POLYNOMIAL-TIME DECIDABLE
SABELFELD, VK
[J]. INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) : 147 - 153
[7] Equivalence of Linear Tree Transducers with Output in the Free Group
Loebel, Raphaela
Luttenberger, Michael
Seidl, Helmut
[J]. DEVELOPMENTS IN LANGUAGE THEORY, DLT 2020, 2020, 12086 : 207 - 221
[8] Deciding equivalence of top-down XML transformations in polynomial time
Engelfriet, Joost
Maneth, Sebastian
Seidl, Helmut
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2009, 75 (05) : 271 - 286
[9] Equivalence of Deterministic Nested Word to Word Transducers
Staworko, Slawomir
Laurence, Gregoire
Lemay, Aurelien
Niehren, Joachim
[J]. FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2009, 5699 : 310 - +
[10] DECIDING EQUIVALENCE OF FINITE TREE AUTOMATA
SEIDL, H
[J]. SIAM JOURNAL ON COMPUTING, 1990, 19 (03) : 424 - 437

← 1 2 3 4 5 →