{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:22:14Z","timestamp":1725895334277},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540882817"},{"type":"electronic","value":"9783540882824"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-88282-4_18","type":"book-chapter","created":{"date-parts":[[2008,9,24]],"date-time":"2008-09-24T07:46:38Z","timestamp":1222242398000},"page":"184-195","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Inclusion Checking for Deterministic Tree Automata and DTDs"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00f4me","family":"Champav\u00e8re","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00e9mi","family":"Gilleron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aur\u00e9lien","family":"Lemay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Niehren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0304-3975(93)90287-4","volume":"120","author":"A. Br\u00fcggemann-Klein","year":"1993","unstructured":"Br\u00fcggemann-Klein, A.: Regular expressions to finite automata. Theoretical Computer Science\u00a0120(2), 197\u2013213 (1993)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1006\/inco.1997.2695","volume":"142","author":"A. Br\u00fcggemann-Klein","year":"1998","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Information and Computation\u00a0142(2), 182\u2013206 (1998)","journal-title":"Information and Computation"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-540-25979-4_8","volume-title":"Rewriting Techniques and Applications","author":"J. Carme","year":"2004","unstructured":"Carme, J., Niehren, J., Tommasi, M.: Querying unranked trees with stepwise tree automata. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 105\u2013118. Springer, Heidelberg (2004)"},{"key":"18_CR4","unstructured":"Champav\u00e8re, J., Gilleron, R., Lemay, A., Niehren, J.: Towards schema-guided XML query induction. In: ICML CAGI Workshop (2007)"},{"key":"18_CR5","unstructured":"Comon, H., et al.: Tree automata techniques and applications (2007), http:\/\/tata.gforge.inria.fr"},{"issue":"3","key":"18_CR6","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/502807.502810","volume":"33","author":"E. Dantsin","year":"2001","unstructured":"Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM computing surveys\u00a033(3), 374\u2013425 (2001)","journal-title":"ACM computing surveys"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Maneth, S., Berlea, A., Perst, T., Seidl, H.: XML type checking with macro tree transducers. In: 24th PODS, pp. 283\u2013294 (2005)","DOI":"10.1145\/1065167.1065203"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Martens, W., Neven, F., Schwentick, T.: Complexity and decision problems for XML Schemas and chain regular expressions. Journal extension of MFCS 2004 (2008)","DOI":"10.1007\/978-3-540-28629-5_70"},{"issue":"4","key":"18_CR9","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1016\/j.jcss.2006.10.021","volume":"73","author":"W. Martens","year":"2007","unstructured":"Martens, W., Niehren, J.: On the minimization of XML schemas and tree automata for unranked trees. J. of Comp. and Sys. Sci.\u00a073(4), 550\u2013583 (2007)","journal-title":"J. of Comp. and Sys. Sci."},{"issue":"66","key":"18_CR10","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0022-0000(02)00030-2","volume":"1","author":"T. Milo","year":"2003","unstructured":"Milo, T., Suciu, D., Vianu, V.: Type checking XML transformers. J. of Comp. and Sys. Sci.\u00a01(66), 66\u201397 (2003)","journal-title":"J. of Comp. and Sys. Sci."},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/978-3-540-49382-2_12","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Neumann","year":"1998","unstructured":"Neumann, A., Seidl, H.: Locating matches of tree patterns in forests. In: Arvind, V., Ramanujam, R. (eds.) FST TCS 1998. LNCS, vol.\u00a01530, pp. 134\u2013145. Springer, Heidelberg (1998)"},{"key":"18_CR12","unstructured":"Raeymaekers, S.: Information Extraction from Web Pages Based on Tree Automata Induction. PhD thesis, Katholieke Universiteit Leuven (2008)"},{"issue":"3","key":"18_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.jcss.2006.10.003","volume":"73","author":"T. Schwentick","year":"2007","unstructured":"Schwentick, T.: Automata for XML\u2014a survey. J. of Comp. and Sys. Sci.\u00a073(3), 289\u2013315 (2007)","journal-title":"J. of Comp. and Sys. Sci."},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1137\/0219027","volume":"19","author":"H. Seidl","year":"1990","unstructured":"Seidl, H.: Deciding equivalence of finite tree automata. SIAM Journal on Computing\u00a019(3), 424\u2013437 (1990)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0020-0190(94)00130-8","volume":"52","author":"H. Seidl","year":"1994","unstructured":"Seidl, H.: Haskell overloading is DEXPTIME-complete. Information Processing Letters\u00a052(2), 57\u201360 (1994)","journal-title":"Information Processing Letters"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Tozawa, A., Hagiya, M.: XML schema containment checking based on semi-implicit techniques. In: Int. Conf. on Impl. and Appl. of Automata (2003)","DOI":"10.1007\/3-540-45089-0_20"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/3-540-44881-0_18","volume-title":"RTA 2003","author":"S. Dal Zilio","year":"2003","unstructured":"Dal Zilio, S., Lugiez, D.: XML schema, tree logic and sheaves automata. In: RTA 2003. LNCS, vol.\u00a02706, pp. 246\u2013263. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88282-4_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:59:54Z","timestamp":1619524794000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88282-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540882817","9783540882824"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88282-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}