The HOM problem is EXPTIME-complete

Consultar RECERCAT

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

Título:	The HOM problem is EXPTIME-complete
Autor/a:	Creus López, Carles; Gascón Caro, Adrià; Godoy Balil, Guillem; Ramos, Lander
Otros autores:	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
Abstract:	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.
Materia(s):	-À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ó
Derechos:
Tipo de documento:	Artículo - Versión publicada Objeto de conferencia
Compartir:

Arias Vicente, Marta; Creus López, Carles; Gascón Caro, Adrià; Godoy Balil, Guillem

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

Coordinación

Patrocinio