Deciding equivalence of top-down XML transformations in polynomial time

被引：24

作者：

Engelfriet, Joost ^{[3
]}

Maneth, Sebastian ^{[1
,2
]}

Seidl, Helmut ^{[4
]}

机构：

[1] NICTA, Sydney, NSW, Australia

[2] Univ NSW, Sydney, NSW, Australia

[3] Leiden Inst Adv Comp Sci, Leiden, Netherlands

[4] Tech Univ Munich, Inst Informat, D-8000 Munich, Germany

来源：

JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2009年 / 75卷 / 05期

关键词：

XML; Top-down tree transducer; Equivalence; Minimization; TREE-TRANSDUCERS;

D O I：

10.1016/j.jcss.2009.01.001

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Many useful XML transformations can be expressed by deterministic top-down tree transducers. A normal form is presented for such transducers (extended with the facility to inspect their input trees). A transducer in normal form has a unique canonical form which can be obtained by a minimization procedure, in polynomial time. Thus, equivalence of transducers in normal form can be decided in polynomial time. If the transducer is total, the normal form can be obtained in polynomial time as well. (C) 2009 Elsevier Inc. All rights reserved.

引用

页码：271 / 286

页数：16

共 50 条

[41] Top-Down Logic
Dierkes, Chris
Air Force Magazine, 2023, 106 (08):
[42] Top-down Control
Goldman, Jason G.
SCIENTIFIC AMERICAN, 2014, 311 (02) : 27 - 27
[43] EQUIVALENCE OF TWO HEALTHCARE COSTING METHODS: BOTTOM-UP AND TOP-DOWN
Chapko, Michael K.
Liu, Chuan-Fen
Perkins, Mark
Li, Yu-Fang
Fortney, John C.
Maciejewski, Matthew L.
HEALTH ECONOMICS, 2009, 18 (10) : 1188 - 1201
[44] The time course of top-down control on saccade averaging
Heeman, J.
Theeuwes, J.
Van der Stigchel, S.
VISION RESEARCH, 2014, 100 : 29 - 37
[45] The equivalence of bottom-up and top-down tree-to-graph transducers
Engelfriet, J
Vogler, H
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1998, 56 (03) : 332 - 356
[46] Top-down determinants of the numerosity-time interaction
Petrizzo, Irene
Pellegrino, Michele
Anobile, Giovanni
Doricchi, Fabrizio
Arrighi, Roberto
SCIENTIFIC REPORTS, 2023, 13 (01)
[47] Searching for "the top" in top-down control
Miller, BT
D'Esposito, M
NEURON, 2005, 48 (04) : 535 - 538
[48] A polynomial-time algorithm for deciding Markov equivalence of directed cyclic graphical models
Richardson, T
UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, 1996, : 462 - 469
[49] On domain and range tree languages of superlinear deterministic top-down tree transformations
Dept. of Found. of Computer Science, József Attila University, P.O. Box 652, H-6701 Szeged, Hungary
Acta Cybernetica, 1996, 12 (03): : 261 - 277
[50] TOP-DOWN TREE-TRANSDUCERS WITH DETERMINISTIC TOP-DOWN LOOK-AHEAD
FULOP, Z
VAGVOLGYI, S
INFORMATION PROCESSING LETTERS, 1989, 33 (01) : 3 - 5

← 1 2 3 4 5 →