{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:59:21Z","timestamp":1725796761167},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662441206"},{"type":"electronic","value":"9783662441213"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44121-3_12","type":"book-chapter","created":{"date-parts":[[2014,7,10]],"date-time":"2014-07-10T10:36:46Z","timestamp":1404988606000},"page":"185-200","source":"Crossref","is-referenced-by-count":0,"title":["The Cantor-Bendixson Analysis of Finite Trees"],"prefix":"10.1007","author":[{"given":"Christian","family":"Wurm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-free Languages. Teubner, Stuttgart (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"issue":"3","key":"12_CR2","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","volume":"15","author":"J. Engelfriet","year":"1977","unstructured":"Engelfriet, J., Schmidt, E.M.: Io and oi. i. J. Comput. Syst. Sci.\u00a015(3), 328\u2013353 (1977)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR3","unstructured":"Fra\u00efss\u00e9, R.: Theory of Relations. Studies in logic and the foundations of mathematics, vol 118. North-Holland (1986)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF01691106","volume":"4","author":"S.A. Greibach","year":"1970","unstructured":"Greibach, S.A.: Chains of full AFL\u2019s. Mathematical Systems Theory\u00a04, 231\u2013242 (1970)","journal-title":"Mathematical Systems Theory"},{"key":"12_CR5","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199252695.001.0001","volume-title":"Efficiency and Complexity in Grammars","author":"J.A. Hawkins","year":"2004","unstructured":"Hawkins, J.A.: Efficiency and Complexity in Grammars. Oxford Univ. Pr., Oxford (2004)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BFb0017480","volume-title":"Trees in Algebra and Programming - CAAP \u201994","author":"D. Hofbauer","year":"1994","unstructured":"Hofbauer, D., Huber, M., Kucherov, G.: Some results on top-context-free tree languages. In: Tison, S. (ed.) CAAP 1994. LNCS, vol.\u00a0787, pp. 157\u2013171. Springer, Heidelberg (1994)"},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10849-011-9134-0","volume":"20","author":"S. Kepser","year":"2011","unstructured":"Kepser, S., Rogers, J.: The equivalence of tree adjoining grammars and monadic linear context-free tree grammars. Journal of Logic, Language and Information\u00a020(3), 361\u2013384 (2011)","journal-title":"Journal of Logic, Language and Information"},{"key":"12_CR8","series-title":"Studies in Generative Grammar","doi-asserted-by":"publisher","DOI":"10.1515\/9783110895667","volume-title":"The Mathematics of Language","author":"M. Kracht","year":"2003","unstructured":"Kracht, M.: The Mathematics of Language. Studies in Generative Grammar, vol.\u00a063. Mouton de Gruyter, Berlin (2003)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Rounds, William C.: Mappings and grammars on trees. Mathematical Systems Theory\u00a04(3), 257\u2013287 (1970)","DOI":"10.1007\/BF01695769"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.2178\/bsl\/1208442827","volume":"14","author":"S. Rubin","year":"2008","unstructured":"Rubin, S.: Automata presenting structures: A survey of the finite string case. Bulletin of Symbolic Logic\u00a014(2), 169\u2013209 (2008)","journal-title":"Bulletin of Symbolic Logic"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(91)90374-B","volume":"88","author":"H. Seki","year":"1991","unstructured":"Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context\u2013free grammars. Theor. Comp. Sci.\u00a088, 191\u2013229 (1991)","journal-title":"Theor. Comp. Sci."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s00012-004-1891-z","volume":"52","author":"H. Simmons","year":"2005","unstructured":"Simmons, H.: The extendend Cantor-Bendixson analysis of trees. Algebra Universalis\u00a052, 439\u2013468 (2005)","journal-title":"Algebra Universalis"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44121-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T07:48:24Z","timestamp":1558943304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44121-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662441206","9783662441213"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44121-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}