{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:52:12Z","timestamp":1760079132632},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281931"},{"type":"electronic","value":"9783540318736"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11537311_7","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:00:06Z","timestamp":1127815206000},"page":"68-79","source":"Crossref","is-referenced-by-count":27,"title":["Deterministic Automata on Unranked Trees"],"prefix":"10.1007","author":[{"given":"Julien","family":"Cristau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christof","family":"L\u00f6ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s00236-002-0085-4","volume":"38","author":"J. Berstel","year":"2002","unstructured":"Berstel, J., Boasson, L.: Formal properties of XML grammars and languages. Acta Informatica\u00a038, 649\u2013671 (2002)","journal-title":"Acta Informatica"},{"key":"7_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J. Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner, Stuttgart (1979)"},{"unstructured":"Br\u00fcggemann-Klein, A., Wood, D., Murata, M.: Regular tree and regular hedge languages over unranked alphabets: Version 1. unfinished technical report (April 2001), http:\/\/citeseer.ist.psu.edu\/451005.html","key":"7_CR3"},{"unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Unpublished electronic book (1997), http:\/\/www.grappa.univ-lille3.fr\/tata","key":"7_CR4"},{"key":"7_CR5","volume-title":"Automata, languages, and machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, languages, and machines, vol.\u00a0A. Academic Press, London (1974)"},{"unstructured":"G\u00e9cseg, F., Steinby, M.: Tree automata. Akad\u00e9miai Kiad\u00f2, Budapest (1984)","key":"7_CR6"},{"doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An nlogn algorithm for minimizing states in a finite automaton. Theory of Machines and Computations, pp. 189\u2013196 (1971)","key":"7_CR7","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"7_CR8","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison Wesley, Reading (1979)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-540-30570-5_5","volume-title":"ICDT","author":"W. Martens","year":"2004","unstructured":"Martens, W., Neven, F., Schwentick, T.: Which XML schemas admit 1-pass preorder typing? In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol.\u00a03363, pp. 68\u201382. Springer, Heidelberg (2004)"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0022-0000(02)00030-2","volume":"66","author":"T. Milo","year":"2003","unstructured":"Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. Journal of Computer and System Sciences\u00a066(1), 66\u201397 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-45793-3_2","volume-title":"CSL 2002","author":"F. Neven","year":"2002","unstructured":"Neven, F.: Automata, logic, and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 2\u201326. Springer, Heidelberg (2002)"},{"key":"7_CR12","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. Theoretical Computer Science\u00a0275, 633\u2013674 (2002)","journal-title":"Theoretical Computer Science"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-46093-4_1","volume-title":"Database Programming Languages, 8th International Workshop, DBPL 2001","author":"D. Suciu","year":"2002","unstructured":"Suciu, D.: Typechecking for semistructured data. In: Ghelli, G., Grahne, G. (eds.) DBPL 2001. LNCS, vol.\u00a02397, pp. 1\u201320. Springer, Heidelberg (2002)"},{"key":"7_CR14","first-page":"33","volume":"5","author":"J. Vir\u00e1gh","year":"1980","unstructured":"Vir\u00e1gh, J.: Deterministic ascending tree automata I. Acta Cybernet\u00a05, 33\u201342 (1980)","journal-title":"Acta Cybernet"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11537311_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:12:28Z","timestamp":1605625948000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11537311_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281931","9783540318736"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11537311_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}