Node Query Preservation for Deterministic Linear Top-Down Tree Transducers

被引：2
|
作者：
Miyahara, Kazuki [1 ]
Hashimoto, Kenji [2 ]
Seki, Hiroyuki [2 ]
机构：
[1] Nara Inst Sci & Technol, Nara, Japan
[2] Nagoya Univ, Nagoya, Aichi, Japan
来源：
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE | 2013年 / 134期
关键词：
D O I：
10.4204/EPTCS.134.4
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper discusses the decidability of node query preservation problems for XML document transformations. We assume a transformation given by a deterministic linear top-down data tree transducer (abbreviated as DLTV) and an n-ary query based on runs of a tree automaton. We say that a DLTV Tr strongly preserves a query Q if there is a query Q' such that for every document t, the answer set of Q for Tr (t) is equal to the answer set of Q for t. Also we say that Tr weakly preserves Q if there is a query Q' such that for every t(d) in the range of Tr, the answer set of Q' for t(d) is equal to the union of the answer set of Q for t such that t(d) = Tr (t). We show that the weak preservation problem is coNP-complete and the strong preservation problem is in 2-EXPTIME.
引用
收藏
页码：27 / 37
页数：11
相关论文
共 50 条
  • [1] Node Query Preservation for Deterministic Linear Top-Down Tree Transducers
    Miyahara, Kazuki
    Hashimoto, Kenji
    Seki, Hiroyuki
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2015, E98D (03): : 512 - 523
  • [2] Superlinear deterministic top-down tree transducers
    Danyi, G
    Fulop, Z
    [J]. MATHEMATICAL SYSTEMS THEORY, 1996, 29 (05): : 507 - 534
  • [3] ON INJECTIVITY OF DETERMINISTIC TOP-DOWN TREE-TRANSDUCERS
    FULOP, Z
    GYENIZSE, P
    [J]. INFORMATION PROCESSING LETTERS, 1993, 48 (04) : 183 - 188
  • [4] TOP-DOWN TREE-TRANSDUCERS WITH DETERMINISTIC TOP-DOWN LOOK-AHEAD
    FULOP, Z
    VAGVOLGYI, S
    [J]. INFORMATION PROCESSING LETTERS, 1989, 33 (01) : 3 - 5
  • [5] UNDECIDABLE PROPERTIES OF DETERMINISTIC TOP-DOWN TREE-TRANSDUCERS
    FULOP, Z
    [J]. THEORETICAL COMPUTER SCIENCE, 1994, 134 (02) : 311 - 328
  • [6] Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations
    Loding, Christof
    Winter, Sarah
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (161): : 88 - 101
  • [7] Synthesis of deterministic top-down tree transducers from automatic tree relations
    Loeding, Christof
    Winter, Sarah
    [J]. INFORMATION AND COMPUTATION, 2017, 253 : 336 - 354
  • [8] 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)
  • [9] 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
  • [10] Composition Closure of Linear Extended Top-down Tree Transducers
    Joost Engelfriet
    Zoltán Fülöp
    Andreas Maletti
    [J]. Theory of Computing Systems, 2017, 60 : 129 - 171
12345