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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00594520
Contributor : Pierre Réty <>
Submitted on : Friday, May 20, 2011 - 9:07:08 AM
Last modification on : Thursday, January 17, 2019 - 3:06:06 PM

Identifiers

  • 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. pp.30-41. ⟨inria-00594520⟩

Share

Metrics

Record views

62