Ircam-Centre Pompidou

Recherche

  • Recherche simple
  • Recherche avancée

    Panier électronique

  • Afficher le contenu du panier
  • Consulter les notices sélectionnées
  • Vider le panier
    Votre panier contient 32 notices

    Connexion à la base

  • Identification
    (Identifiez-vous pour accéder aux fonctions de mise à jour. Utilisez votre login-password de courrier électronique)

    Entrepôt OAI-PMH

  • Soumettre une requête

    Consulter la notice détailléeConsulter la notice détaillée
    Version complète en ligneVersion complète en ligne
    Version complète en ligne accessible uniquement depuis l'IrcamVersion complète en ligne accessible uniquement depuis l'Ircam
    Ajouter la notice au panierAjouter la notice au panier
    Retirer la notice du panierRetirer la notice du panier

  • English version
    (full translation not yet available)
  • Liste complète des articles

    • Consultation des notices

    Vue détaillée Vue Refer Vue Labintel Vue BibTeX  

    %0 Journal Article
    %A Barguno, Luis
    %A Creus, Carlos
    %A Godoy, Guillem
    %A Jacquemard, Florent
    %A Vacher, Camille
    %T Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
    %D 2013
    %B Logical Methods in Computer Science
    %V 2
    %N 9
    %F Barguno13a
    %X 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.
    %1 1
    %2 1
    © Ircam - Centre Pompidou 2005.