5 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.LO2013★ 5 cited
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…
cs.LO2010★ 1 cited
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…