Author:
Creus Carles,Godoy Guillem,Ramos Lander
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference8 articles.
1. For a rewrite system it is decidable whether the set of irreducible, ground terms is recognizable;Vágvölgyi;Bull. Eur. Assoc. Theor. Comput. Sci.,1992
2. Patterns in words versus patterns in trees: A brief survey and new results;Kucherov,1999
3. Deciding regularity of the set of instances of a set of terms with regular constraints is EXPTIME-complete;Giménez;SIAM J. Comput.,2011
4. The HOM problem is EXPTIME-complete;Creus,2012