Search

• < Previous
• 1
• Next >

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

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;]