{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:04Z","timestamp":1759637704573,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705888"},{"type":"electronic","value":"9783540705901"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70590-1_15","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"217-231","source":"Crossref","is-referenced-by-count":3,"title":["Logics and Automata for Totally Ordered Trees"],"prefix":"10.1007","author":[{"given":"Marco","family":"Kuhlmann","sequence":"first","affiliation":[]},{"given":"Joachim","family":"Niehren","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Culotta, A., Sorensen, J.: Dependency tree kernels for relation extraction. In: 42nd Annual Meeting of the ACL, pp. 423\u2013429 (2004)","DOI":"10.3115\/1218955.1219009"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Quirk, C., Menezes, A., Cherry, C.: Dependency treelet translation: Syntactically informed phrasal SMT. In: 43rd Annual Meeting of the ACL, pp. 271\u2013279 (2005)","DOI":"10.3115\/1219840.1219874"},{"key":"15_CR3","unstructured":"Nivre, J., Hall, J., K\u00fcbler, S., McDonald, R., Nilsson, J., Riedel, S., Yuret, D.: The CoNLL 2007 shared task on dependency parsing. In: Joint Conference on Empirical Methods in NLP and Computational Natural Language Learning, pp. 915\u2013932 (2007)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1968","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata with an application to a decision problem of second-order logic. Math. System Theory\u00a02, 57\u201382 (1968)","journal-title":"Math. System Theory"},{"key":"15_CR5","unstructured":"Courcelle, B.: Handbook of graph grammars and computing by graph transformations. Foundations. Handbook of Graph Grammars, vol.\u00a01 (1997)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C.: Monadic queries over tree-structured data. In: 17th Annual IEEE Symposium on Logic in Computer Science, pp. 189\u2013202 (2002)","DOI":"10.1109\/LICS.2002.1029828"},{"key":"15_CR7","unstructured":"Courcelle, B.: Graph Grammars and Logic. Book in preparation (2008)"},{"key":"15_CR8","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997\/2007)"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1995086","volume":"141","author":"M. Rabin","year":"1969","unstructured":"Rabin, M.: Decidability of Second-Order Theories and Automata on Infinite Trees. Transactions of the American Mathematical Society\u00a0141, 1\u201335 (1969)","journal-title":"Transactions of the American Mathematical Society"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C.: Monadic datalog and the expressive power of languages for web information extraction. In: 21rd ACM PODS, pp. 17\u201328 (2002)","DOI":"10.1145\/543613.543617"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Pl\u00e1tek, M., Holan, T., Kubo\u0148, V.: On relaxability of word order by D-Grammars. In: 3rd Int. Conf. on Combinatorics, Computability and Logic. DMTCS, pp. 159\u2013174 (2001)","DOI":"10.1007\/978-1-4471-0717-0_14"},{"key":"15_CR12","unstructured":"Kuhlmann, M.: Dependency Structures and Lexicalized Grammars. Doctoral dissertation, Saarland University, Saarbr\u00fccken, Germany (2007)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Koller, A., Striegnitz, K.: Generation as dependency parsing. In: 40th Annual Meeting of the ACL, pp. 17\u201324 (2002)","DOI":"10.3115\/1073083.1073088"},{"key":"15_CR14","unstructured":"Holan, T., Kubo\u0148, V., Oliva, K., Pl\u00e1tek, M.: Two useful measures of word order complexity. Work. on Processing of Dependency-Based Grammars, 21\u201329 (1998)"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Kuhlmann, M., Nivre, J.: Mildly non-projective dependency structures. In: 21st COLING-ACL, Main Conference Poster Sessions, pp. 507\u2013514 (2006)","DOI":"10.3115\/1273073.1273139"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"Mezei, J., Wright, J.B.: Algebraic automata and context-free sets. Information and Control\u00a011, 3\u201329 (1967)","journal-title":"Information and Control"},{"key":"15_CR17","volume-title":"Tree Automata and Languages","author":"B. Courcelle","year":"1992","unstructured":"Courcelle, B.: Recognizable sets of unrooted trees. In: Nivat, M., Podelski, A. (eds.) Tree Automata and Languages. Elsevier Science, Amsterdam (1992)"},{"key":"15_CR18","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)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70590-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:14:36Z","timestamp":1738325676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705888","9783540705901"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}