activity
20082026
most citedVisibly Tree Automata with Memory and Constraints

13 citations · 27 across the 9 of their papers we have counts for

collaborators
Showing 2013 · cs.LOShow all

1 paper · 2 filters

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…