Deciding equivalence of finite tree automata
SIAM Journal on Computing
Ordered and Unordered Tree Inclusion
SIAM Journal on Computing
One-unambiguous regular languages
Information and Computation
Characterization of Glushkov automata
Theoretical Computer Science
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
XML to Relational Conversion Using Theory of Regular Tree Grammars
Proceedings of the VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DTWeb on Efficiency and Effectiveness of XML Tools and Techniques and Data Integration over the Web-Revised Papers
A New Algorithm for the Ordered Tree Inclusion Problem
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Tree inclusion algorithm, signatures and evaluation of path-oriented queries
Proceedings of the 2006 ACM symposium on Applied computing
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
Language and Automata Theory and Applications
Efficient asymmetric inclusion between regular expression types
Proceedings of the 12th International Conference on Database Theory
Efficient algorithms for descendant-only tree pattern queries
Information Systems
Linear inclusion for XML regular expression types
Proceedings of the 18th ACM conference on Information and knowledge management
The tree inclusion problem: in optimal space and faster
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Weak inclusion for recursive XML types
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Conservative type extensions for XML data
Transactions on Large-Scale Data- and Knowledge-centered systems IX
| Hi-index | 0.00 |
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.