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

Abstract : We define a class of ranked tree automata TABG generalizing both the tree automata with local brother tests 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 equational theory between brother subterms and between subterms whose positions are defined by the states reached during a computation. In particular, TABG can check that all the subterms reaching a given state are distinct. This constraint is related to monadic key constraints for XML documents, meaning that every two distinct positions of a given type have different values. We prove decidability of the emptiness problem for TABG. This solves, in particular, the open question of decidability of emptiness for TAGED. We further extend our result by allowing global arithmetic constraints for counting the number of occurrences of some state or the number of different equivalence classes of subterms (modulo a given flat equational theory) reaching some state during a computation. We also adapt the model to unranked ordered terms. As a consequence of our results for TABG, we prove the decidability of a fragment of the monadic second order logic on trees extended with predicates for equality and disequality between subtrees, and cardinality.
Type de document :
Article dans une revue
Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2013, 9 (2), pp.1-39. 〈http://www.lmcs-online.org/ojs/viewarticle.php?id=1240〉
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00852382
Contributeur : Florent Jacquemard <>
Soumis le : mardi 20 août 2013 - 18:33:07
Dernière modification le : mercredi 29 novembre 2017 - 16:33:33
Document(s) archivé(s) le : jeudi 21 novembre 2013 - 04:15:48

Fichier

1302.6960.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00852382, version 1

Collections

Citation

Luis Barguñó, Carlos Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher. Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2013, 9 (2), pp.1-39. 〈http://www.lmcs-online.org/ojs/viewarticle.php?id=1240〉. 〈hal-00852382〉

Partager

Métriques

Consultations de la notice

562

Téléchargements de fichiers

226