Weighted Tree Automata with Constraints

被引：2
|
作者：
Maletti, Andreas [1 ]
Nasz, Andreea-Teodora [1 ]
机构：
[1] Univ Leipzig, Fac Math & Comp Sci, POB 100 920, D-04009 Leipzig, Germany
来源：
THEORY OF COMPUTING SYSTEMS | 2024年 / 68卷 / 01期
关键词：
Weighted tree automaton; Subtree equality constraint; Tree homomorphism; HOM problem; Weighted tree grammar; Subtree inequality constraint; Closure properties;
D O I：
10.1007/s00224-023-10144-w
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The HOM problem, which asks whether the image of a regular tree language under a given tree homomorphism is again regular, is known to be decidable [Godoy & Gimenez: The HOM problem is decidable. JACM 60(4), 2013]. However, the problem remains open for regular weighted tree languages. It is demonstrated that the main notion used in the unweighted setting, the tree automaton with equality and inequality constraints , can straightforwardly be generalized to the weighted setting and can represent the image of any regular weighted tree language under any nondeleting and nonerasing tree homomorphism. Several closure properties as well as decision problems are also investigated for the weighted tree languages generated by weighted tree automata with constraints.
引用
收藏
页码：1 / 28
页数：28
相关论文
共 50 条
  • [21] THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
    Esik, Zoltan
    Maletti, Andreas
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2011, 22 (08) : 1845 - 1859
  • [22] DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
    Stueber, Torsten
    Vogler, Heiko
    Zoltan Fueloep
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2009, 20 (02) : 221 - 245
  • [23] Ambiguity Hierarchies for Weighted Tree Automata
    Maletti, Andreas
    Nasz, Teodora
    Stier, Kevin
    Ulbricht, Markus
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2023, 34 (08) : 903 - 921
  • [24] Weighted Logics for Unranked Tree Automata
    Droste, Manfred
    Vogler, Heiko
    THEORY OF COMPUTING SYSTEMS, 2011, 48 (01) : 23 - 47
  • [25] Ambiguity Hierarchies for Weighted Tree Automata
    Maletti, Andreas
    Nasz, Teodora
    Stier, Kevin
    Ulbricht, Markus
    IMPLEMENTATION AND APPLICATION OF AUTOMATA (CIAA 2021), 2021, 12803 : 140 - 151
  • [26] Relating tree series transducers and weighted tree automata
    Maletti, A
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2005, 16 (04) : 723 - 741
  • [27] Relating tree series transducers and weighted tree automata
    Maletti, A
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2004, 3340 : 321 - 333
  • [28] Visibly tree automata with memory and constraints
    LSV, CNRS/ENS Cachan, France
    不详
    不详
    Log. Methods Comp. Sci., 2008, 2
  • [29] VISIBLY TREE AUTOMATA WITH MEMORY AND CONSTRAINTS
    Comon-Lundh, Hubert
    Jacquemard, Florent
    Perrin, Nicolas
    LOGICAL METHODS IN COMPUTER SCIENCE, 2008, 4 (02)
  • [30] Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics
    Droste, Manfred
    Heusel, Doreen
    Vogler, Heiko
    ALGEBRAIC INFORMATICS (CAI 2015), 2015, 9270 : 90 - 102
12345