{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T23:33:10Z","timestamp":1761607990655,"version":"build-2065373602"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3406,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100008737","name":"Direcci\u00c3\u00b3n General de Ense\u00c3\u00b1anza Superior e Investigaci\u00c3\u00b3n Cient\u00c3\u00adfica","doi-asserted-by":"publisher","award":["SB 97\u201300110508"],"award-info":[{"award-number":["SB 97\u201300110508"]}],"id":[{"id":"10.13039\/501100008737","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s1571-0661(05)82579-4","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T09:46:30Z","timestamp":1116495990000},"page":"137-145","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Chomsky-Sch\u00fctzenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages"],"prefix":"10.1016","volume":"53","author":[{"given":"Masami","family":"Ito","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Mart\u00edn-Vide","sequence":"additional","affiliation":[]},{"given":"Victor","family":"Mitrana","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)82579-4_BIB1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(93)90327-P","article-title":"Language-theoretic problems arising from Richelieu cryptosystems","volume":"116","author":"Andrasiu","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S1571-0661(05)82579-4_BIB2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0020-0190(87)90162-1","article-title":"Prefixes of infinite words and ambiguous context-free languages","volume":"25","author":"Autebert","year":"1987","journal-title":"Inform. Process. Letters"},{"key":"10.1016\/S1571-0661(05)82579-4_BIB3","unstructured":"Berstel, J. Sur la densit\u00e9 asymptotique de langages formels. In M. Nivat, ed.,\u201dAutomata, Languages and Programming\u201d North-Holland, 1972, 345-358."},{"key":"10.1016\/S1571-0661(05)82579-4_BIB4","series-title":"\u201cThe Handbook of Formal Languages\u201d vol. I","first-page":"329","article-title":"Combinatorics on words","author":"Choffrut","year":"1997"},{"key":"10.1016\/S1571-0661(05)82579-4_BIB5","series-title":"\u201cComputer Programming and Formal Systems\u201d","first-page":"118","article-title":"The algebraic theory of context-free languages","author":"Chomsky","year":"1963"},{"key":"10.1016\/S1571-0661(05)82579-4_BIB6","first-page":"152","article-title":"On thinness and slenderness of languages","volume":"49","author":"Dassow","year":"1993","journal-title":"EATCS Bulletin"},{"key":"10.1016\/S1571-0661(05)82579-4_BIB7","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0304-3975(87)90011-9","article-title":"Analytic models and ambiguity of context-free languages","volume":"49","author":"Flajolet","year":"1987","journal-title":"Theoret. Comput. Sci."},{"year":"1966","series-title":"\u201cThe Mathematical Theory of Context-Free Languages\u201d","author":"Ginsburg","key":"10.1016\/S1571-0661(05)82579-4_BIB8"},{"key":"10.1016\/S1571-0661(05)82579-4_BIB9","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1007\/s002360050134","article-title":"Decision problems concerning thiness and slenderness of formal languages","volume":"35","author":"Honkala","year":"1998","journal-title":"Acta Inform."},{"key":"10.1016\/S1571-0661(05)82579-4_BIB10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1006\/jcss.1996.0014","article-title":"On Parikh slender languages and power series","volume":"52","author":"Honkala","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S1571-0661(05)82579-4_BIB11","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/0304-3975(94)00042-5","article-title":"On a conjectue about slender context-free languages","volume":"132","author":"Ilie","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S1571-0661(05)82579-4_BIB12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1051\/ita:2000100","article-title":"A characterization of poly-slender context-free languages","volume":"34","author":"Ilie","year":"2000","journal-title":"Theor. Inform. Appl."},{"year":"1983","series-title":"\u201cCombinatorics on Words\u201d","author":"Lothaire","key":"10.1016\/S1571-0661(05)82579-4_BIB13"},{"key":"10.1016\/S1571-0661(05)82579-4_BIB14","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF00288770","article-title":"Rational bijection of rational sets","volume":"13","author":"Maurer","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/S1571-0661(05)82579-4_BIB15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(95)00067-4","article-title":"Slender OL languages","volume":"158","author":"Nishida","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S1571-0661(05)82579-4_BIB16","first-page":"171","article-title":"Decision problems concerning the thinness of D0L languages","volume":"46","author":"P\u0103un","year":"1992","journal-title":"EATCS Bulletin"},{"key":"10.1016\/S1571-0661(05)82579-4_BIB17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(93)90293-3","article-title":"Closure properties of slender languages","volume":"120","author":"P\u0103un","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S1571-0661(05)82579-4_BIB18","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0166-218X(94)00014-5","article-title":"Thin and slender languages","volume":"61","author":"P\u0103un","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S1571-0661(05)82579-4_BIB19","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0304-3975(96)00308-8","article-title":"Length considerations in context-free languages","volume":"183","author":"Raz","year":"1997","journal-title":"Theoret. Comput. Sci."},{"year":"1980","series-title":"\u201cThe Mathematical Theory of L Systems\u201d","author":"Rozenberg","key":"10.1016\/S1571-0661(05)82579-4_BIB20"},{"key":"10.1016\/S1571-0661(05)82579-4_BIB21","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1006\/inco.1994.1076","article-title":"Numeration systems, linear recurrences, and regular sets","volume":"113","author":"Shallit","year":"1994","journal-title":"Inform, and Comput."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825794?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825794?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T23:29:46Z","timestamp":1761607786000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105825794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":21,"alternative-id":["S1571066105825794"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82579-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2004,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Chomsky-Sch\u00fctzenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)82579-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2004 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}