{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:13:45Z","timestamp":1725484425124},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442394"},{"type":"electronic","value":"9783540457909"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45790-9_9","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T02:46:02Z","timestamp":1179283562000},"page":"106-119","source":"Crossref","is-referenced-by-count":3,"title":["On Limit Points for Some Variants of Rigid Lambek Grammars"],"prefix":"10.1007","author":[{"given":"Annie","family":"Foret","sequence":"first","affiliation":[]},{"given":"Yannick","family":"Le Nir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,5]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Dana Angluin. Inductive inference of formal languages from positive data. Information and Control, 45:117\u2013135, 1980.","journal-title":"Information and Control"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.2307\/410452","volume":"29","author":"Y. Bar-Hillel","year":"1953","unstructured":"Y. Bar-Hillel. A quasi arithmetical notation for syntactic description. Language, 29:47\u201358, 1953.","journal-title":"Language"},{"key":"9_CR3","unstructured":"Roberto Bonato and Christian Retor\u00e9. Learning rigid lambek grammars and minimalist grammars from structured sentences. Third workshop on Learning Language in Logic, Strasbourg, 2001."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/B978-044481714-3\/50016-3","volume-title":"Handbook of Logic and Language","author":"W. Buszkowski","year":"1997","unstructured":"W. Buszkowski. Mathematical linguistics and proof theory. In van Benthem and ter Meulen [vBtM97], chapter 12, pages 683\u2013736."},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-94-015-6878-4_5","volume-title":"Categorial Grammars and Natural Language Structures","author":"C. Casadio","year":"1988","unstructured":"Claudia Casadio. Semantic categories and the development of categorial grammars. In R. Oehrle, E. Bach, and D. Wheeler, editors, Categorial Grammars and Natural Language Structures, pages 95\u2013124. Reidel, Dordrecht, 1988."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"C. Costa Flor\u00eancio. Consistent Identification in the Limit of the Class k-valued is NP-hard. In LACL, 2001.","DOI":"10.1007\/3-540-48199-0_8"},{"key":"9_CR7","unstructured":"Dudau-Sofronie, Tellier, and Tommasi. Learning categorial grammars from semantic types. In 13th Amsterdam Colloquium, 2001."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Annie Foret and Yannick Le Nir. Rigid lambek grammars are not learnable from strings. Coling 2002. http:\/\/www.irisa.fr\/prive\/foret\/learn.ps .","DOI":"10.3115\/1072228.1072339"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"E.M. Gold. Language identification in the limit. Information and control, 10:447\u2013474, 1967.","journal-title":"Information and control"},{"key":"9_CR10","unstructured":"Makoto Kanazawa. Learnable classes of categorial grammars. Studies in Logic, Language and Information. FoLLI & CSLI, 1998. distributed by Cambridge University Press."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"154","DOI":"10.2307\/2310058","volume":"65","author":"J. Lambek","year":"1958","unstructured":"Joachim Lambek. The mathematics of sentence structure. American mathematical monthly, 65:154\u2013169, 1958.","journal-title":"American mathematical monthly"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/B978-044481714-3\/50005-9","volume-title":"Handbook of Logic and Language","author":"M. Moortgat","year":"1997","unstructured":"Michael Moortgat. Categorial type logic. In van Benthem and ter Meulen [vBtM97], chapter 2, pages 93\u2013177."},{"key":"9_CR13","unstructured":"Jacques Nicolas. Grammatical inference as unification. Rapport de Recherche RR-3632, INRIA, 1999. http:\/\/www.inria.fr\/RRRT\/publications-eng.html ."},{"key":"9_CR14","unstructured":"Mati Pentus. Lambek grammars are context-free. In Logic in Computer Science. IEEE Computer Society Press, 1993."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"T. Shinohara. Inductive inference from positive data is powerful. In The 1990 Workshop on Computational Learning Theory, pages 97\u2013110, San Mateo, California, 1990. Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-146-8.50010-2"},{"volume-title":"Handbook of Logic and Language","year":"1997","key":"9_CR16","unstructured":"J. van Benthem and A. ter Meulen, editors. Handbook of Logic and Language. North-Holland Elsevier, Amsterdam, 1997."}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45790-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T00:55:22Z","timestamp":1556412922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45790-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442394","9783540457909"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45790-9_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}