The HOM problem is decidable
Visualitza/Obre
Tipus de documentReport de recerca
Data publicació2009-06
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
We close affirmatively a question which has been open for 35 years: decidability of the HOM problem. The HOM problem consists in deciding, given a tree homomorphism $H$ and a regular tree languagle $L$ represented by a tree automaton, whether $H(L)$ is regular. For deciding the HOM problem, we develop new constructions and techniques which are interesting by themselves, and provide several significant intermediate results. For example, we prove that the universality problem is decidable for languages represented by tree automata with equality constraints, and that the equivalence and inclusion problems are decidable for images of regular languages through tree homomorphisms. Our contributions are based on the following new results. We describe a simple transformation for converting a tree automaton with equality constraints into a tree automaton with disequality constraints recognizing the complementary language. We also define a new class of automaton with arbitrary disequality constraints and a particular kind of equality constraints. This new class essentially recognizes the intersection of a tree automaton with disequality constraints and the image of a regular language through a tree homomorphism. We prove decidability of emptiness and finiteness for this class by a pumping mechanism. The above constructions are combined adequately to provide an algorithm deciding the HOM problem.
CitacióGodoy, G., Giménez, O., Ramos, L., Álvarez, C. "The HOM problem is decidable". 2009.
Forma partLSI-09-22-R
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
R09-22.pdf | 303,4Kb | Visualitza/Obre |