PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Efficient Inclusion Checking for Deterministic Tree Automata and XML Schemas
Rémi Gilleron, Joachim Niehren and Jérome Champavère
Information and Computation Volume 11, Number 207, pp. 1181-1208, 2009.


We present algorithms for testing language inclusion L(A) ⊆ L(B) between tree automata in time O(|A| · |B|) where B is deterministic (bottom-up or top-down). We extend our algorithms for testing inclusion of automata for unranked trees A in deterministic DTDs or deterministic EDTDs with re- strained competition D in time O(|A| · |Σ| · |D|). Previous algorithms were less efficient or less general.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:6016
Deposited By:Aurélien Lemay
Deposited On:08 March 2010