Unranked tree automata with sibling equalities and disequalities

被引：0
|
作者：
Karianto, Wong [1 ]
Loeding, Christof [1 ]
机构：
[1] Rhein Westfal TH Aachen, Lehrstuhl Informat 7, D-5100 Aachen, Germany
来源：
AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS | 2007年 / 4596卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We propose an extension of the tree automata with constraints between direct subtrees (Bogaert and Tison, 1992) to unranked trees. Our approach uses MSO-formulas to capture the possibility of comparing unboundedly many direct subtrees. Our main result is that the nonemptiness problem for the deterministic automata, as in the ranked setting, is decidable. Furthermore, we show that the non deterministic automata are more expressive than the deterministic ones.
引用
收藏
页码：875 / +
页数：3
相关论文
共 50 条
  • [1] The Supports of Weighted Unranked Tree Automata
    Droste, Manfred
    Heusel, Doreen
    [J]. FUNDAMENTA INFORMATICAE, 2015, 136 (1-2) : 37 - 58
  • [2] Weighted Logics for Unranked Tree Automata
    Manfred Droste
    Heiko Vogler
    [J]. Theory of Computing Systems, 2011, 48 : 23 - 47
  • [3] Minimizing tree automata for unranked trees
    Martens, W
    Niehren, J
    [J]. DATABASE PROGRAMMING LANGUAGES, 2005, 3774 : 232 - +
  • [4] Weighted Logics for Unranked Tree Automata
    Droste, Manfred
    Vogler, Heiko
    [J]. THEORY OF COMPUTING SYSTEMS, 2011, 48 (01) : 23 - 47
  • [5] Querying unranked trees with stepwise tree automata
    Carme, J
    Niehren, J
    Tommasi, M
    [J]. REWRITING TECHNIQUES AND APPLICATIONS, PROCEEDINGS, 2004, 3091 : 105 - 118
  • [6] Lower bounds for the size of deterministic unranked tree automata
    Piao, Xiaoxue
    Salomaa, Kai
    [J]. THEORETICAL COMPUTER SCIENCE, 2012, 454 : 231 - 239
  • [7] Operational State Complexity of Deterministic Unranked Tree Automata
    Piao, Xiaoxue
    Salomaa, Kai
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (31): : 149 - 158
  • [8] On the minimization of XML Schemas and tree automata for unranked trees
    Martens, Wim
    Niehren, Joachim
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2007, 73 (04) : 550 - 583
  • [9] NESTED SIBLING TREE AUTOMATA
    Gire, Francoise
    Talbot, Jean-Marc
    [J]. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2009, 43 (02) : 379 - 402
  • [10] Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics
    Droste, Manfred
    Heusel, Doreen
    Vogler, Heiko
    [J]. ALGEBRAIC INFORMATICS (CAI 2015), 2015, 9270 : 90 - 102
12345