Show simple item record

dc.contributor.authorGodoy, Guillem
dc.contributor.authorGiménez, Omer
dc.contributor.authorRamos Garrido, Lander
dc.contributor.authorÁlvarez Faura, M. del Carme
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2016-06-14T11:51:17Z
dc.date.available2016-06-14T11:51:17Z
dc.date.issued2009-06
dc.identifier.citationGodoy, G., Giménez, O., Ramos, L., Álvarez, C. "The HOM problem is decidable". 2009.
dc.identifier.urihttp://hdl.handle.net/2117/87972
dc.description.abstractWe 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.
dc.format.extent39 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-09-22-R
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherTree automata
dc.subject.otherTree homomorphisms
dc.subject.otherHom problem
dc.titleThe HOM problem is decidable
dc.typeExternal research report
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.rights.accessOpen Access
local.identifier.drac18558837
dc.description.versionPostprint (published version)
local.citation.authorGodoy, G.; Giménez, O.; Ramos, L.; Álvarez, C.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder