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

5 citations · 5 across the 1 of their papers we have counts for

collaborators

1 paper

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…