Search

• < Previous
• 1
• Next >

---

Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories

Luis Barguñó ; Carles Creus ; Guillem Godoy ; Florent Jacquemard ; Camille Vacher.

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 disequality constraints (TAGED) of Filiot et al. (2007). TABG can test for equality and disequality modulo a given flat&nbsp;[&hellip;]

---

Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories

Luis Barguno ; Guillem Godoy ; Eduard Huntingford ; Ashish Tiwari.

We present decidability results for termination of classes of term rewriting systems modulo permutative theories. Termination and innermost termination modulo permutative theories are shown to be decidable for term rewrite systems (TRS) whose right-hand side terms are restricted to be shallow&nbsp;[&hellip;]

---