{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,26]],"date-time":"2025-01-26T05:27:20Z","timestamp":1737869240068,"version":"3.33.0"},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1968,8,1]],"date-time":"1968-08-01T00:00:00Z","timestamp":-44755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T00:00:00Z","timestamp":1376697600000},"content-version":"vor","delay-in-days":16452,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1968,8]]},"DOI":"10.1016\/s0022-0000(68)80029-7","type":"journal-article","created":{"date-parts":[[2008,1,3]],"date-time":"2008-01-03T15:37:03Z","timestamp":1199374623000},"page":"148-168","source":"Crossref","is-referenced-by-count":1,"title":["Closures which preserve finiteness in families of languages"],"prefix":"10.1016","volume":"2","author":[{"given":"Gene F.","family":"Rose","sequence":"first","affiliation":[]}],"member":"78","reference":[{"year":"1967","series-title":"Sets Accepted by One-Way Stack Automata are Context Sensitive. Internal document","author":"Hopcroft","key":"10.1016\/S0022-0000(68)80029-7_bib1"},{"key":"10.1016\/S0022-0000(68)80029-7_bib2","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/321239.321249","article-title":"Derivatives of regular expressions","volume":"11","author":"Brzozowski","year":"1964","journal-title":"J. Assoc. Computing Mach."},{"key":"10.1016\/S0022-0000(68)80029-7_bib3","doi-asserted-by":"crossref","unstructured":"C. C. Elgot and J. D. Rutledge. Operations on finite automata, in \u201cProceedings of the AIEE Second Annual Symposium on Switching Circuit Theory Logical Design,\u201d pp. 129\u2013132. AIEE.","DOI":"10.1109\/FOCS.1961.26"},{"year":"1966","author":"Ginsburg","key":"10.1016\/S0022-0000(68)80029-7_bib4"},{"key":"10.1016\/S0022-0000(68)80029-7_bib5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/321160.321167","article-title":"Operations which preserve definability in languages","volume":"10","author":"Ginsburg","year":"1963","journal-title":"J. Assoc. Computing Machinery"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000068800297?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000068800297?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,1,25]],"date-time":"2025-01-25T07:55:17Z","timestamp":1737791717000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000068800297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1968,8]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1968,8]]}},"alternative-id":["S0022000068800297"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(68)80029-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[1968,8]]}}}