{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:41:26Z","timestamp":1725579686763},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642320231"},{"type":"electronic","value":"9783642320248"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32024-8_14","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T03:58:00Z","timestamp":1342238280000},"page":"208-227","source":"Crossref","is-referenced-by-count":7,"title":["Locality and the Complexity of Minimalist Derivation Tree Languages"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Graf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1614431.1614435","volume":"11","author":"M. Benedikt","year":"2009","unstructured":"Benedikt, M., Segoufin, L.: Regular tree languages definable in FO and in FOmod. ACM Transactions in Computational Logic\u00a011, 1\u201332 (2009)","journal-title":"ACM Transactions in Computational Logic"},{"key":"14_CR2","volume-title":"The Minimalist Program","author":"N. Chomsky","year":"1995","unstructured":"Chomsky, N.: The Minimalist Program. MIT Press, Cambridge (1995)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1075\/livy.9.03dik","volume":"9","author":"M. Dikken den","year":"2009","unstructured":"den Dikken, M.: Arguments for successive-cyclic movement through SpecCP. A critical review. Linguistic Variation Yearbook\u00a09, 89\u2013126 (2009)","journal-title":"A critical review. Linguistic Variation Yearbook"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science (LNAI)","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/978-3-642-22221-4_7","volume-title":"LACL 2011","author":"T. Graf","year":"2011","unstructured":"Graf, T.: Closure properties of minimalist derivation tree languages. In: Pogodalla, S., Prost, J.-P. (eds.) LACL 2011. Lecture Notes in Computer Science (LNAI), vol.\u00a06736, pp. 96\u2013111. Springer, Heidelberg (2011)"},{"key":"14_CR5","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Academei Kaido, Budapest (1984)"},{"key":"14_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-48199-0_12","volume-title":"Logical Aspects of Computational Linguistics","author":"H. Harkema","year":"2001","unstructured":"Harkema, H.: A Characterization of Minimalist Languages. In: de Groote, P., Morrill, G., Retor\u00e9, C. (eds.) LACL 2001. LNCS (LNAI), vol.\u00a02099, pp. 193\u2013211. Springer, Heidelberg (2001)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-22221-4_9","volume-title":"Logical Aspects of Computational Linguistics","author":"G.M. Kobele","year":"2011","unstructured":"Kobele, G.M.: Minimalist Tree Languages Are Closed Under Intersection with Recognizable Tree Languages. In: Pogodalla, S., Prost, J.-P. (eds.) LACL 2011. LNCS, vol.\u00a06736, pp. 129\u2013144. Springer, Heidelberg (2011)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Kobele, G.M., Retor\u00e9, C., Salvati, S.: An automata-theoretic approach to minimalism. In: Rogers, J., Kepser, S. (eds.) Model Theoretic Syntax at 10, pp. 71\u201380 (2007)","DOI":"10.1111\/j.1467-9612.2007.00094.x"},{"key":"14_CR9","unstructured":"Mainguy, T.: A probabilistic top-down parser for Minimalist grammars (2010), arXiv:1010.1826v1"},{"key":"14_CR10","unstructured":"Martens, W.: Static Analysis of XML Transformation- and Schema Languages. Ph.D. thesis, Hasselt University (2006)"},{"key":"14_CR11","unstructured":"Martens, W., Neven, F., Schwentick, T.: Deterministic top-down tree automata: Past, present, and future. In: Proceedings of Logic and Automata, pp. 505\u2013530 (2008)"},{"key":"14_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-48199-0_14","volume-title":"Logical Aspects of Computational Linguistics","author":"J. Michaelis","year":"2001","unstructured":"Michaelis, J.: Transforming linear context-free rewriting systems into minimalist grammars. In: de Groote, P., Morrill, G., Retor\u00e9, C. (eds.) LACL 2001. LNCS (LNAI), vol.\u00a02099, pp. 228\u2013244. Springer, Heidelberg (2001)"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1137\/S0097539789164078","volume":"26","author":"M. Nivat","year":"1997","unstructured":"Nivat, M., Podelski, A.: Minimal ascending and descending tree automata. SIAM Journal on Computing\u00a026, 39\u201358 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Potthoff, A., Thomas, W.: Regular tree languages without unary symbols are star-free. In: Proceedings of the 9th International Symposium on Fundamentals of Computation Theory, pp. 396\u2013405 (1993)","DOI":"10.1007\/3-540-57163-9_34"},{"key":"14_CR15","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-free grammars. Theoretical Computer Science\u00a088, 191\u2013229 (1991)","journal-title":"Theoretical Computer Science"},{"key":"14_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0052152","volume-title":"Logical Aspects of Computational Linguistics","author":"E.P. Stabler","year":"1997","unstructured":"Stabler, E.P.: Derivational minimalism. In: Retor\u00e9, C. (ed.) LACL 1996. LNCS (LNAI), vol.\u00a01328, pp. 68\u201395. Springer, Heidelberg (1997)"},{"key":"14_CR17","first-page":"617","volume-title":"Oxford Handbook of Linguistic Minimalism","author":"E.P. Stabler","year":"2011","unstructured":"Stabler, E.P.: Computational perspectives on minimalism. In: Boeckx, C. (ed.) Oxford Handbook of Linguistic Minimalism, pp. 617\u2013643. Oxford University Press, Oxford (2011)"},{"key":"14_CR18","unstructured":"Stabler, E.P.: Top-down recognizers for MCFGs and MGs. In: Workshop on Cognitive Modeling and Computational Linguistics, pp. 39\u201348. ACL, Portland (2011)"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/S0304-3975(01)00351-6","volume":"293","author":"E.P. Stabler","year":"2003","unstructured":"Stabler, E.P., Keenan, E.: Structural similarity. Theoretical Computer Science\u00a0293, 345\u2013363 (2003)","journal-title":"Theoretical Computer Science"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 389\u2013455. Springer, New York (1997)"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"1040","DOI":"10.1109\/TPAMI.2005.144","volume":"27","author":"J.L. Verd\u00fa-Mas","year":"2005","unstructured":"Verd\u00fa-Mas, J.L., Carrasco, R.C., Calera-Rubio, J.: Parsing with probabilistic strictly locally testable tree languages. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a027, 1040\u20131050 (2005)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32024-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T19:17:58Z","timestamp":1561922278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32024-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642320231","9783642320248"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32024-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}