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 条

[41] Polynomial-time word problems
Schleimer, Saul
[J]. COMMENTARII MATHEMATICI HELVETICI, 2008, 83 (04) : 741 - 765
[42] A simple tree-based algorithm for deciding the stability of discrete-time switched linear systems
Dercole, Fabio
Della Rossa, Fabio
[J]. 2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2017,
[43] The structure of polynomial growth for tree automata/transducers and MSO set queries
Gallot, Paul
Lhote, Nathan
Nguyễn, Lê Thành Dũng
[J]. arXiv,
[44] LINEAR TIME ALGORITHM FOR DECIDING SUBJECT SECURITY
LIPTON, RJ
SNYDER, L
[J]. JOURNAL OF THE ACM, 1977, 24 (03) : 455 - 464
[45] The time complexity of typechecking tree-walking tree transducers
Engelfriet, Joost
[J]. ACTA INFORMATICA, 2009, 46 (02) : 139 - 154
[46] The time complexity of typechecking tree-walking tree transducers
Joost Engelfriet
[J]. Acta Informatica, 2009, 46 : 139 - 154
[47] Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width
Fuerer, Martin
[J]. LATIN 2010: THEORETICAL INFORMATICS, 2010, 6034 : 49 - 59
[48] A Polynomial-Time Algorithm for Checking the Equivalence of Deterministic Restricted One-Counter Transducers Which Accept by Final State
Wakatsuki, Mitsuo
Tomita, Etsuji
Nishino, Tetsuro
[J]. SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING, 2015, 569 : 131 - 144
[49] On the equivalence problem for letter-to-letter top-down tree transducers
Andre, Y
Bossut, F
[J]. THEORETICAL COMPUTER SCIENCE, 1998, 205 (1-2) : 207 - 229
[50] 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

← 1 2 3 4 5 →