Exploració per autor "Godoy Balil, Guillem"Més informació

Ara es mostren els items 12-15 de 15

    • The HOM problem is EXPTIME-complete 

      Creus López, Carles; Gascon Caro, Adrian; Godoy Balil, Guillem; Ramos Garrido, Lander (2016)
      Article
      Accés obert
      We define a new class of tree automata with constraints and prove decidability of the emptiness problem for this class in exponential time. As a consequence, we obtain several EXPTIME-completeness results for problems on ...

    • 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. ...

    • Tree automata with height constraints between brothers 

      Creus López, Carles; Godoy Balil, Guillem (Springer, 2014)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      We define the tree automata with height constraints between brothers (TACBB H ). Constraints of equalities and inequalities between heights of siblings that restrict the applicability of the rules are allowed in TACBB H. ...

    • Unification and matching on compressed terms 

      Gascón Caro, Adrià; Godoy Balil, Guillem; Schmidt-Schauß, Manfred (2011-07-29)
      Article
      Accés restringit per política de l'editorial
      Term unification plays an important role in many areas of computer science, especially in those related to logic. The universal mechanism of grammar-based compression for terms, in particular the so-called singleton tree ...