Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/19252

The HOM problem is EXPTIME-complete
Creus López, Carles; Gascón Caro, Adrià; Godoy Balil, Guillem; Ramos, Lander
Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics; Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
The HOM problem questions whether the image of a given regular tree language through a given tree homomorphism is also regular. Decidability of HOM is an important theoretical question which was open for a long time. Recently, HOM has been proved decidable with a triple exponential time algorithm. In this paper we obtain an exponential time algorithm for this problem, and conclude that it is EXPTIME-complete. The proof builds upon previous results and techniques on tree automata with constraints.
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
HOM problem
Tree automata
Decision problem
Statistical decision
Tree homomorphisms
Problema de decisió
info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/conferenceObject
         

Mostrar el registro completo del ítem

Documentos relacionados

Otros documentos del mismo autor/a

Creus López, Carles; Gascón Caro, Adrià; Godoy Balil, Guillem
Gascón Caro, Adrià; Godoy Balil, Guillem; Schmidt-Schauß, Manfred
Barguño, Luis; Creus López, Carles; Godoy Balil, Guillem; Jacquemard, Florent; Vacher, Camile
Creus López, Carles; Godoy Balil, Guillem; Massanes Basi, Francesc d'Assis; Tiwari, Ashish Kumar