@inproceedings{https___doi.org_10.4230_lipics.stacs.2024.51,
    doi = {10.4230/lipics.stacs.2024.51},
    url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.51},
    author = {Maletti, Andreas and Nász, Andreea-Teodora and Paul, Erik},
    keywords = {Weighted Tree Automaton, Decision Problem, Subtree Equality Constraint, Tree Homomorphism, HOM-Problem, Weighted Tree Grammar, Weighted HOM-Problem, Theory of computation → Quantitative automata, Theory of computation → Computability, Theory of computation → Tree languages, Theory of computation → Grammars and context-free languages},
    language = {en},
    title = {Weighted HOM-Problem for Nonnegative Integers},
    publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
    year = {2024},
    copyright = {Creative Commons Attribution 4.0 International license},
    date-added = {2025-2-6 7:24:20 +0100}
}

@inproceedings{https___doi.org_10.4230_lipics.stacs.2024.51, doi = {10.4230/lipics.stacs.2024.51}, url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.51}, author = {Maletti, Andreas and Nász, Andreea-Teodora and Paul, Erik}, keywords = {Weighted Tree Automaton, Decision Problem, Subtree Equality Constraint, Tree Homomorphism, HOM-Problem, Weighted Tree Grammar, Weighted HOM-Problem, Theory of computation → Quantitative automata, Theory of computation → Computability, Theory of computation → Tree languages, Theory of computation → Grammars and context-free languages}, language = {en}, title = {Weighted HOM-Problem for Nonnegative Integers}, publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, year = {2024}, copyright = {Creative Commons Attribution 4.0 International license}, date-added = {2025-2-6 7:24:20 +0100} }