13 citations · 46 across the 14 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.FL2023★ 1 cited
Weighted HOM-Problem for Nonnegative Integers
Andreas Maletti, Andreea-Teodora Nász, Erik Paul
The HOM-problem asks whether the image of a regular tree language under a given tree homomorphism is again regular. It was recently shown to be decidable by Godoy, Giménez, Ramos,…
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…