Exploració per tema "Tree homomorphisms"

Ara es mostren els items 1-2 de 2

    • The HOM problem is decidable 

      Godoy, Guillem; Giménez, Omer; Ramos Garrido, Lander; Álvarez Faura, M. del Carme (2009-06)
      Report de recerca
      Accés obert
      We 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 ...

    • The HOM problem is EXPTIME-complete 

      Creus López, Carles; Gascón Caro, Adrià; Godoy Balil, Guillem; Ramos, Lander (2012)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      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. ...