The HOM problem is EXPTIME-complete

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/19252

Title:	The HOM problem is EXPTIME-complete
Author:	Creus López, Carles; Gascón Caro, Adrià; Godoy Balil, Guillem; Ramos, Lander
Other authors:	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.
Subject(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ó
Rights:
Document type:	Article - Published version Conference Object
Share: