The HOM problem is EXPTIME-complete
Tipus de documentArticle
Condicions d'accésAccés obert
We define a new class of tree automata with constraints and prove decidability of the emptiness problem for this class in exponential time. As a consequence, we obtain several EXPTIME-completeness results for problems on images of regular tree languages under tree homomorphisms, like set inclusion, regularity (HOM problem), and finiteness of set difference. Our result also has implications in term rewriting, since the set of reducible terms of a term rewrite system can be described as the image of a tree homomorphism. In particular, we prove that inclusion of sets of normal forms of term rewrite systems can be decided in exponential time. Analogous consequences arise in the context of XML typechecking, since types are defined by tree automata and some type transformations are homomorphic.
CitacióCreus, C., Gascon, A., Godoy, G., Ramos, L. The HOM problem is EXPTIME-complete. "SIAM journal on computing", 2016, vol. 45, núm. 4, p. 1230-1260.
Versió de l'editorhttp://epubs.siam.org/doi/10.1137/140999104