Tree Automata With Global Constraints

Abstract : 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.
Type de document :
Article dans une revue
International Journal of Foundations of Computer Science, World Scientific Publishing, 2010, 21 (4), pp.571-596. 〈10.1142/S012905411000743X〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00526987
Contributeur : Sophie Tison <>
Soumis le : dimanche 17 octobre 2010 - 18:21:44
Dernière modification le : jeudi 21 février 2019 - 10:52:49

Lien texte intégral

Identifiants

Collections

Citation

Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison. Tree Automata With Global Constraints. International Journal of Foundations of Computer Science, World Scientific Publishing, 2010, 21 (4), pp.571-596. 〈10.1142/S012905411000743X〉. 〈hal-00526987〉

Partager

Métriques

Consultations de la notice

300