{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T18:12:03Z","timestamp":1767895923586,"version":"3.49.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7198,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,11]]},"DOI":"10.1016\/0304-3975(93)90293-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"293-301","source":"Crossref","is-referenced-by-count":15,"title":["Closure properties of slender languages"],"prefix":"10.1016","volume":"120","author":[{"given":"Gheorghe","family":"Pa\u016dn","sequence":"first","affiliation":[]},{"given":"Arto","family":"Salomaa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90293-3_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\/0304-3975(93)90293-3_BIB2","series-title":"Computer Programming and Formal Systems","first-page":"118","article-title":"The algebraic theory of context-free languages","author":"Chomsky","year":"1963"},{"key":"10.1016\/0304-3975(93)90293-3_BIB3","series-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/0304-3975(93)90293-3_BIB4","series-title":"Algebraic and Automata-Theoretic Properties of Formal Languages","author":"Ginsburg","year":"1975"},{"key":"10.1016\/0304-3975(93)90293-3_BIB5","series-title":"Ph.D. Thesis","article-title":"On Insertion and Deletion in Formal Languages","author":"Kari","year":"1991"},{"key":"10.1016\/0304-3975(93)90293-3_BIB6","series-title":"Mecanisme generative ale proceselor economice","author":"P\u0103un","year":"1980"},{"key":"10.1016\/0304-3975(93)90293-3_BIB7","series-title":"Thin and slender languages","author":"P\u0103un","year":"1991"},{"key":"10.1016\/0304-3975(93)90293-3_BIB8","series-title":"Formal Languages","author":"Salomaa","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593902933?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593902933?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:25:02Z","timestamp":1555129502000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397593902933"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["0304397593902933"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90293-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}