Now showing items 1-5 of 5

  • Emptiness and finiteness for tree automata with global reflexive disequality constraints 

    Creus López, Carles; Gascón Caro, Adrià; Godoy Balil, Guillem (2013-12-01)
    Article
    Restricted access - publisher's policy
    In recent years, several extensions of tree automata have been considered. Most of them are related with the capability of testing equality or disequality of certain subterms of the term evaluated by the automaton. In ...
  • Learning theory through videos: a teaching experience in a theoretical course based on self-learning videos and problem-solving sessions 

    Arias Vicente, Marta; Creus López, Carles; Gascón Caro, Adrià; Godoy Balil, Guillem (SciTePress, 2011)
    Conference report
    Restricted access - publisher's policy
    In this paper we describe a teaching experience applied to a theoretical course tought in a computer science degree. The main feature of our experiment is the introduction of videos specifically designed for self-learning ...
  • The HOM problem is EXPTIME-complete 

    Creus López, Carles; Gascón Caro, Adrià; Godoy Balil, Guillem; Ramos, Lander (2012)
    Conference report
    Restricted access - publisher's policy
    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. ...
  • Unification and matching on compressed terms 

    Gascón Caro, Adrià; Godoy Balil, Guillem; Schmidt-Schauß, Manfred (2011-07-29)
    Article
    Restricted access - publisher's policy
    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 ...
  • Variants of unification considering compression and context variables 

    Gascón Caro, Adrià (Universitat Politècnica de Catalunya, 2014-05-30)
    Doctoral thesis