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 条
  • [31] A Backward and a Forward Simulation for Weighted Tree Automata
    Maletti, Andreas
    ALGEBRAIC INFORMATICS, 2009, 5725 : 288 - 304
  • [32] On Finite and Polynomial Ambiguity of Weighted Tree Automata
    Paul, Erik
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2016, 2016, 9840 : 368 - 379
  • [33] Selected Topics in Weighted Tree Automata Abstract
    Fueloep, Zoltan
    INFORMATICS 2013: PROCEEDINGS OF THE TWELFTH INTERNATIONAL CONFERENCE ON INFORMATICS, 2013, : 16 - 17
  • [34] Tree automata with memory, visibility and structural constraints
    Comon-Lundh, Hubert
    Jacquemard, Florent
    Perrin, Nicolas
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, 2007, 4423 : 168 - +
  • [35] The Emptiness Problem for Tree Automata with Global Constraints
    Barguno, Luis
    Creus, Carles
    Godoy, Guillem
    Jacquemard, Florent
    Vacher, Camille
    25TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2010), 2010, : 263 - 272
  • [36] Tree Automata with Global Constraints for Infinite Trees
    Landwehr, Patrick
    Loeding, Christof
    36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019), 2019,
  • [37] Solving classes of set constraints with tree automata
    Devienne, P
    Talbot, JM
    Tison, S
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 97, 1997, 1330 : 62 - 76
  • [38] Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
    Droste, Manfred
    Goetze, Doreen
    Maercker, Steffen
    Meinecke, Ingmar
    ALGEBRAIC FOUNDATIONS IN COMPUTER SCIENCE: ESSAYS DEDICATED TO SYMEON BOZAPALIDIS ON THE OCCASION OF HIS RETIREMENT, 2011, 7020 : 30 - 55
  • [39] A Kleene Theorem for Weighted Tree Automata over Tree Valuation Monoids
    Droste, Manfred
    Fueloep, Zoltan
    Goetze, Doreen
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, LATA 2016, 2016, 9618 : 452 - 463
  • [40] A Kleene theorem for weighted tree automata over tree valuation monoids
    Goetze, Doreen
    Fulop, Zoltan
    Droste, Manfred
    INFORMATION AND COMPUTATION, 2019, 269
12345