Abstract
We present a new algorithm for testing language inclusion L(A) ⊆ L(B) between tree automata in time O(|A|*|B|) where B is deterministic. We extend this algorithm for testing inclusion between automata for unranked trees A and deterministic DTDs D in time O(|A|*|Σ|*|D|). No previous algorithms with these complexities exist.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brüggemann-Klein, A.: Regular expressions to finite automata. Theoretical Computer Science 120(2), 197–213 (1993)
Brüggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Information and Computation 142(2), 182–206 (1998)
Carme, J., Niehren, J., Tommasi, M.: Querying unranked trees with stepwise tree automata. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 105–118. Springer, Heidelberg (2004)
Champavère, J., Gilleron, R., Lemay, A., Niehren, J.: Towards schema-guided XML query induction. In: ICML CAGI Workshop (2007)
Comon, H., et al.: Tree automata techniques and applications (2007), http://tata.gforge.inria.fr
Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM computing surveys 33(3), 374–425 (2001)
Maneth, S., Berlea, A., Perst, T., Seidl, H.: XML type checking with macro tree transducers. In: 24th PODS, pp. 283–294 (2005)
Martens, W., Neven, F., Schwentick, T.: Complexity and decision problems for XML Schemas and chain regular expressions. Journal extension of MFCS 2004 (2008)
Martens, W., Niehren, J.: On the minimization of XML schemas and tree automata for unranked trees. J. of Comp. and Sys. Sci. 73(4), 550–583 (2007)
Milo, T., Suciu, D., Vianu, V.: Type checking XML transformers. J. of Comp. and Sys. Sci. 1(66), 66–97 (2003)
Neumann, A., Seidl, H.: Locating matches of tree patterns in forests. In: Arvind, V., Ramanujam, R. (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 134–145. Springer, Heidelberg (1998)
Raeymaekers, S.: Information Extraction from Web Pages Based on Tree Automata Induction. PhD thesis, Katholieke Universiteit Leuven (2008)
Schwentick, T.: Automata for XML—a survey. J. of Comp. and Sys. Sci. 73(3), 289–315 (2007)
Seidl, H.: Deciding equivalence of finite tree automata. SIAM Journal on Computing 19(3), 424–437 (1990)
Seidl, H.: Haskell overloading is DEXPTIME-complete. Information Processing Letters 52(2), 57–60 (1994)
Tozawa, A., Hagiya, M.: XML schema containment checking based on semi-implicit techniques. In: Int. Conf. on Impl. and Appl. of Automata (2003)
Dal Zilio, S., Lugiez, D.: XML schema, tree logic and sheaves automata. In: RTA 2003. LNCS, vol. 2706, pp. 246–263. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Champavère, J., Gilleron, R., Lemay, A., Niehren, J. (2008). Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. In: Martín-Vide, C., Otto, F., Fernau, H. (eds) Language and Automata Theory and Applications. LATA 2008. Lecture Notes in Computer Science, vol 5196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88282-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-88282-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88281-7
Online ISBN: 978-3-540-88282-4
eBook Packages: Computer ScienceComputer Science (R0)