Weighted HOM-Problem for Nonnegative Integers
Formal Languages and Automata Theory
2023-05-09 v1
Abstract
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\'enez, Ramos, and \`Alvarez. In this paper, the N-weighted version of this problem is considered and its decidability is proved. More precisely, it is decidable in polynomial time whether the image of a regular N-weighted tree language under a nondeleting, nonerasing tree homomorphism is regular.
Keywords
Cite
@article{arxiv.2305.04117,
title = {Weighted HOM-Problem for Nonnegative Integers},
author = {Andreas Maletti and Andreea-Teodora Nász and Erik Paul},
journal= {arXiv preprint arXiv:2305.04117},
year = {2023}
}