Weak Inclusion for XML Types

Abstract : Considering that the unranked tree languages L(G) and L(G') are those defined by given non-recursive XML types G and G', this paper proposes a simple and intuitive method to verify whether L(G) is ''approximatively'' included in L(G'). Our approximative criterion consists in weakening the father-children relationships. Experimental results are discussed, showing the efficiency of our method in many situations.
Type de document :
Communication dans un congrès
International Conference on Implementation and Application of Automata (CIAA), Jul 2011, Blois, France. Springer-Verlag, 6807, pp.30-41, 2011, LNCS
Liste complète des métadonnées

https://hal.inria.fr/inria-00594520
Contributeur : Pierre Réty <>
Soumis le : vendredi 20 mai 2011 - 09:07:08
Dernière modification le : mercredi 29 novembre 2017 - 10:18:40

Identifiants

  • HAL Id : inria-00594520, version 1

Collections

Citation

Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari Alves, Pierre Réty. Weak Inclusion for XML Types. International Conference on Implementation and Application of Automata (CIAA), Jul 2011, Blois, France. Springer-Verlag, 6807, pp.30-41, 2011, LNCS. 〈inria-00594520〉

Partager

Métriques

Consultations de la notice

58