{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:26Z","timestamp":1725558986878},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540257837"},{"type":"electronic","value":"9783540319535"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11422532_22","type":"book-chapter","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T22:15:43Z","timestamp":1278972943000},"page":"330-346","source":"Crossref","is-referenced-by-count":8,"title":["The Complexity and Generative Capacity of Lexicalized Abstract Categorial Grammars"],"prefix":"10.1007","author":[{"given":"Ryo","family":"Yoshinaka","sequence":"first","affiliation":[]},{"given":"Makoto","family":"Kanazawa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"de Groote, P.: Towards abstract categorial grammars. In: Association for Computational Linguistics, 39th Annual Meeting and 10th Conference of the European Chapter, Proceedings of the Conference, pp. 148\u2013155 (2001)","DOI":"10.3115\/1073012.1073045"},{"key":"22_CR2","unstructured":"de Groote, P.: Tree-adjoining grammars as abstract categorial grammars. In: TAG+6, Proceedings of the 6th International Workshop on Tree Adjoining Grammars and Related Frameworks, Universit\u00e0 di Venezia, pp. 145\u2013150 (2002)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"de Groote, P., Guillaume, B., Salvati, S.: Vector addition tree automata. In: Proceedings of the 19th Annual IEEE symposium on Logic in Computer Science, July 2004, pp. 64\u201373 (2004)","DOI":"10.1109\/LICS.2004.1319601"},{"key":"22_CR4","unstructured":"de Groote, P., Pogodalla, S.: m-linear context-free rewriting systems as abstract categorial grammars. In: Oehrle, R.T., Rogers, J. (eds.) Proceedings of Mathematics of Language - MOL-8, Bloomington, Indiana, U.S, June, pp. 71\u201380 (2003)"},{"issue":"4","key":"22_CR5","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s10849-004-2114-x","volume":"13","author":"P. Groote de","year":"2004","unstructured":"de Groote, P., Pogodalla, S.: On the expressive power of abstract categorial grammars: Representing context-free formalisms. Journal of Logic, Language and Information\u00a013(4), 421\u2013438 (2004)","journal-title":"Journal of Logic, Language and Information"},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science\u00a08(2), 135\u2013159 (1979)","journal-title":"Theoretical Computer Science"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0168-0072(94)90085-X","volume":"69","author":"M.I. Kanovich","year":"1994","unstructured":"Kanovich, M.I.: The complexity of Horn fragments of linear logic. Annals of Pure and Applied Logic\u00a069, 195\u2013241 (1994)","journal-title":"Annals of Pure and Applied Logic"},{"key":"22_CR8","first-page":"447","volume-title":"Studies in Generative Grammar","author":"M. Kracht","year":"2003","unstructured":"Kracht, M.: The Mathematics of Language. In: Studies in Generative Grammar, vol.\u00a063, pp. 447\u2013459. Mouton de Gruyter, Berlin (2003)"},{"key":"22_CR9","unstructured":"Lipton, R.J.: The reachability problem requires exponential space. Technical Report\u00a062, Department of Computer Science, Yale University (January 1976)"},{"key":"22_CR10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-94-010-0037-6_2","volume-title":"Resource Sensitivity in Binding and Anaphora","author":"R. Muskens","year":"2003","unstructured":"Muskens, R.: Language, lambdas, and logic. In: Kruijff, G.-J., Oehrle, R. (eds.) Resource Sensitivity in Binding and Anaphora, Studies in Linguistics and Philosophy, pp. 23\u201354. Kluwer, Dordrecht (2003)"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Rounds, W.C.: Complexity of recognition in intermediate-level languages. In: Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, October 1973, pp. 145\u2013158 (1973)","DOI":"10.1109\/SWAT.1973.5"}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11422532_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:54:33Z","timestamp":1558281273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11422532_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540257837","9783540319535"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11422532_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}