{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:09:47Z","timestamp":1742926187462,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":14,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781461482666"},{"type":"electronic","value":"9781461482659"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-1-4614-8265-9_1563","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T13:22:02Z","timestamp":1544102522000},"page":"4822-4826","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["XML Types"],"prefix":"10.1007","author":[{"given":"Frank","family":"Neven","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"issue":"2","key":"1563_CR24267","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 into finite automata. Theor Comput Sci. 1993;120(2): 197\u2013213.","journal-title":"Theor Comput Sci"},{"issue":"2","key":"1563_CR24268","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1006\/inco.1997.2688","volume":"140","author":"A Br\u00fcggemann-Klein","year":"1998","unstructured":"Br\u00fcggemann-Klein A, Wood D. One unambiguous regular languages. Inf Comput. 1998;140(2): 229\u201353.","journal-title":"Inf Comput"},{"key":"1563_CR24269","unstructured":"Br\u00fcggemann-Klein A, Murata M, Wood D. Regular tree and regular hedge languages over unranked alphabets. Technical report HKUST-TCSC-2001-0. The Hongkong University of Science and Technology; 2001."},{"key":"1563_CR24270","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-25979-4_8","volume-title":"Rewriting Techniques and Applications","author":"Julien Carme","year":"2004","unstructured":"Carme J, Niehren J, Tommasi M. Querying unranked trees with stepwise tree automata. In: Proceedings of the 15th International Conference on Rewriting Techniques and Applications; 2004. p. 105\u201318."},{"key":"1563_CR24271","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/11537311_7","volume-title":"Fundamentals of Computation Theory","author":"Julien Cristau","year":"2005","unstructured":"Cristau J, L\u00f6ding C, Thomas W. Deterministic automata on unranked trees. In: Proceedings of the 15th International Symposium on Fundamentals of Computation Theory; 2005. p. 68\u201379."},{"issue":"1\u20133","key":"1563_CR24272","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.tcs.2006.05.004","volume":"360","author":"H Hosoya","year":"2006","unstructured":"Hosoya H, Murata M. Boolean operations and inclusion test for attribute-element constraints. Theor Comput Sci. 2006;360(1\u20133):327\u201351.","journal-title":"Theor Comput Sci"},{"key":"1563_CR24273","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/11601524_15","volume-title":"Database Programming Languages","author":"Wim Martens","year":"2005","unstructured":"Martens W, Niehren J. Minimizing tree automata for unranked trees. In: Proceedings of the 10th International Workshop on Database Programming Languages; 2005. p. 232\u201346."},{"issue":"3","key":"1563_CR24274","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1145\/1166074.1166076","volume":"31","author":"W Martens","year":"2006","unstructured":"Martens W, Neven F, Schwentick T, Bex GJ. Expressiveness and complexity of XML schema. ACM Trans Database Syst. 2006;31(3):770\u2013813.","journal-title":"ACM Trans Database Syst"},{"issue":"4","key":"1563_CR24275","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/1324185.1324188","volume":"36","author":"W Martens","year":"2007","unstructured":"Martens W, Neven F, Schwentick T. Simple off the shelf abstractions for XML schema. ACM SIGMOD Rec. 2007;36(4):15\u201322.","journal-title":"ACM SIGMOD Rec"},{"issue":"4","key":"1563_CR24276","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1145\/1111627.1111631","volume":"5","author":"M Murata","year":"2005","unstructured":"Murata M, Lee D, Mani M, Kawaguchi K. Taxonomy of XML schema languages using formal language theory. ACM Trans Internet Technol. 2005;5(4):660\u2013704.","journal-title":"ACM Trans Internet Technol"},{"issue":"3","key":"1563_CR24277","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/601858.601869","volume":"31","author":"F Neven","year":"2002","unstructured":"Neven F. Automata theory for XML researchers. ACM SIGMOD Rec. 2002;31(3):39\u201346.","journal-title":"ACM SIGMOD Rec"},{"key":"1563_CR24278","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/S0304-3975(01)00301-2","volume":"275","author":"F Neven","year":"2002","unstructured":"Neven F, Schwentick T. Query automata on finite trees. Theor Comput Sci. 2002;275:633\u201374.","journal-title":"Theor Comput Sci"},{"key":"1563_CR24279","doi-asserted-by":"crossref","unstructured":"Segoufin L, Vianu V. Validating streaming XML documents. In: Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 2002. p. 53\u201364.","DOI":"10.1145\/543613.543622"},{"issue":"4","key":"1563_CR24280","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","volume":"1","author":"JW Thatcher","year":"1967","unstructured":"Thatcher JW. Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. J Comput Syst Sci. 1967;1(4):317\u201322.","journal-title":"J Comput Syst Sci"}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-8265-9_1563","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T22:41:22Z","timestamp":1591051282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4614-8265-9_1563"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9781461482666","9781461482659"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-8265-9_1563","relation":{},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}