par Filiot, Emmanuel ;Talbot, Jean-Marc;Tison, Sophie
Référence International journal of foundations of computer science, 21, 4, page (571-596)
Publication Publié, 2010
Article révisé par les pairs
Résumé : We define tree automata with global equality and disequality constraints (TAGED). TAGEDs can test (dis)equalities between subtrees which may be arbitrarily faraway. In particular, they are equipped with an equality relation and a disequality relation on states, so that whenever two subtrees t and t′ evaluate (in an accepting run) to two states which are in the (dis)equality relation, they must be (dis)equal. We study several properties of TAGEDs, and prove emptiness decidability of for several expressive subclasses of TAGEDs.