Efficient Inclusion Checking for Deterministic Tree Automata and DTDs

Authors:
Jérôme Champavère;Rémi Gilleron;Aurélien Lemay;Joachim Niehren
Affiliations:
INRIA Futurs and Lille University, LIFL, Mostrare project,;INRIA Futurs and Lille University, LIFL, Mostrare project,;INRIA Futurs and Lille University, LIFL, Mostrare project,;INRIA Futurs and Lille University, LIFL, Mostrare project,
Venue:
Language and Automata Theory and Applications
Year:
2008

Citing 10
Cited 4

Deciding equivalence of finite tree automata

SIAM Journal on Computing
Regular expressions into finite automata

Theoretical Computer Science
Haskell overloading is DEXPTIME-complete

Information Processing Letters
One-unambiguous regular languages

Information and Computation
Complexity and expressive power of logic programming

ACM Computing Surveys (CSUR)
Locating Matches of Tree Patterns in Forests

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Typechecking for XML transformers

Journal of Computer and System Sciences - Special issue on PODS 2000
XML type checking with macro tree transducers

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Automata for XML---A survey

Journal of Computer and System Sciences
On the minimization of XML Schemas and tree automata for unranked trees

Journal of Computer and System Sciences

Schema-Guided Induction of Monadic Queries

ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Subtyping algorithm of regular tree grammars with disjoint production rules

ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Weak inclusion for XML types

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Weak inclusion for recursive XML types

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new algorithm for testing language inclusion L(A) ⊆ L(B) between tree automata in time O(|A|*|B|) where Bis deterministic. We extend this algorithm for testing inclusion between automata for unranked trees Aand deterministic DTDs Din time O(|A|*|Σ|*|D|). No previous algorithms with these complexities exist.