{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:27Z","timestamp":1725664167697},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590422"},{"type":"electronic","value":"9783540491750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59042-0_95","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:59:04Z","timestamp":1330275544000},"page":"445-454","source":"Crossref","is-referenced-by-count":3,"title":["On slender context-free languages"],"prefix":"10.1007","author":[{"given":"Danny","family":"Raz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(93)90327-P","volume":"116","author":"M. Andrasiu","year":"1993","unstructured":"M. Andrasiu, J. Dassow, Gh. P\u0103un and A. Salomaa, \u201cLanguage-theoretic problems arising from Richelieu cryptosystems\u201d, Theoretical Computer Science 116 (1993), 339\u2013357.","journal-title":"Theoretical Computer Science"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill Book Company, 1966.","DOI":"10.1145\/321312.321318"},{"key":"39_CR3","unstructured":"M. A. Harrison, Introduction to Formal Language Theory, Addison-Wesley Publishing Company, 1978, pp. 312\u2013326."},{"key":"39_CR4","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/0304-3975(94)00042-5","volume":"132","author":"L. Ilie","year":"1994","unstructured":"L. Ilie, \u201cOn a conjecture about slender context-free languages\u201d, Theoretical Computer Science 132 (1994), 427\u2013434.","journal-title":"Theoretical Computer Science"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"G. P\u0103un and A. Salomaa, \u201cThin and Slender Languages\u201d, Discrete Applied Mathematics, to appear.","DOI":"10.1016\/0166-218X(94)00014-5"},{"key":"39_CR6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(93)90293-3","volume":"120","author":"G. P\u0103un","year":"1993","unstructured":"G. P\u0103un and A. Salomaa, \u201cClosure Properties of Slender Languages\u201d, Theoretical Computer Science 120 (1993), 293\u2013301.","journal-title":"Theoretical Computer Science"},{"key":"39_CR7","first-page":"171","volume":"46","author":"G. P\u0103un","year":"1992","unstructured":"G. P\u0103un and A. Salomaa, \u201cDecision Problems Concerning the Thinness of DOL Languages\u201d, Bulletin of the EATCS 46 (1992), 171\u2013181.","journal-title":"Bulletin of the EATCS"},{"key":"39_CR8","unstructured":"D. Raz \u201cRecurrence in Formal Languages\u201d, in preparation."}],"container-title":["Lecture Notes in Computer Science","STACS 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_95.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T08:55:08Z","timestamp":1640940908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_95"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_95","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}