{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:38Z","timestamp":1725558938874},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137532"},{"type":"electronic","value":"9783642137549"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13754-9_7","type":"book-chapter","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T11:05:52Z","timestamp":1277895952000},"page":"144-166","source":"Crossref","is-referenced-by-count":0,"title":["Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Genkin","sequence":"first","affiliation":[]},{"given":"Nissim","family":"Francez","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaminski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Aizikowitz, T., Francez, N., Genkin, D., Kaminski, M.: Extending free pregroups with lower bounds. Studia Logica (to appear)","DOI":"10.1007\/s11225-010-9264-4"},{"key":"7_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/3-540-48199-0_6","volume-title":"Logical Aspects of Computational Linguistics","author":"W. Buszkowski","year":"2001","unstructured":"Buszkowski, W.: Lambek grammars based on pregroups. In: Groote, P.D., Morrill, G., Retor\u00e8, C. (eds.) LACL 2001. LNCS (LNAI), vol.\u00a02099, pp. 95\u2013109. Springer, Heidelberg (2001)"},{"key":"7_CR3","unstructured":"Buszkowski, W., Moroz, K.: Pregroup grammars and context-free grammars. In: Pre-proceedings of the international workshop on non-classical formal languages in linguistics, Tarragona, Spain, Research Group on Mathematical Linguistics, Universitat Rovira i Virgili (2007)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s11225-007-9088-z","volume":"87","author":"N. Francez","year":"2007","unstructured":"Francez, N., Kaminski, M.: Commutation-extended pregroup grammars and mildly context-sensitive languages. Studia Logica\u00a087, 295\u2013321 (2007)","journal-title":"Studia Logica"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1016\/j.ic.2008.03.004","volume":"206","author":"N. Francez","year":"2008","unstructured":"Francez, N., Kaminski, M.: Commutation-augmented pregroup grammars and push-down automaton with cancellation. Information and Computation\u00a0206, 1018\u20131032 (2008)","journal-title":"Information and Computation"},{"key":"7_CR6","volume-title":"Introduction to automata theory, languages, and computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to automata theory, languages, and computation. Addison-Wesley, Reading (1979)"},{"key":"7_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48975-4_1","volume-title":"Logical Aspects of Computational Linguistics","author":"J. Lambek","year":"1999","unstructured":"Lambek, J.: Type grammars revisited. In: Lecomte, A., Perrier, G., Lamarche, F. (eds.) LACL 1997. LNCS (LNAI), vol.\u00a01582, pp. 1\u201327. Springer, Heidelberg (1999)"},{"key":"7_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BFb0052165","volume-title":"Logical Aspects of Computational Linguistics","author":"J. Michaelis","year":"1997","unstructured":"Michaelis, J., Kracht, M.: Semilinearity as a syntactic invariant. In: Retor\u00e9, C. (ed.) LACL 1996. LNCS (LNAI), vol.\u00a01328, pp. 329\u2013345. Springer, Heidelberg (1997)"},{"issue":"6","key":"7_CR9","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/BF01191624","volume":"27","author":"K. Vijay-Shanker","year":"1994","unstructured":"Vijay-Shanker, K., Weir, D.: The equivalence of four extensions of context-free grammars. Mathematical Systems Theory\u00a027(6), 511\u2013546 (1994)","journal-title":"Mathematical Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Time for Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13754-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T06:59:56Z","timestamp":1552633196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13754-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137532","9783642137549"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13754-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}