3 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.FL2023★ 3 cited
Solving the Weighted HOM-Problem With the Help of Unambiguity
Andreea-Teodora Nász
The HOM-problem, which asks whether the image of a regular tree language under a tree homomorphism is again regular, is known to be decidable by [Godoy, Giménez, Ramos, Àlvarez: Th…
cs.FL2023★ 1 cited
Weighted Tree Automata with Constraints
Andreas Maletti, Andreea-Teodora Nász
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 & Giménez: The HOM proble…