5 citations · 7 across the 3 of their papers we have counts for
4 papers
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
Luis Barguñó, Carles Creus, Guillem Godoy +2
We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequ…
Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories
Luis Barguno, Guillem Godoy, Eduard Huntingford +1
We present decidability results for termination of classes of term rewriting systems modulo permutative theories. Termination and innermost termination modulo permutative theories…
Unification and Matching on Compressed Terms
Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß
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…
Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete
Omer Giménez, Guillem Godoy, Sebastian Maneth
Finite-state tree automata are a well studied formalism for representing term languages. This paper studies the problem of determining the regularity of the set of instances of a f…