{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T18:07:10Z","timestamp":1697825230727},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"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":9360,"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":[[1987,12]]},"DOI":"10.1016\/0022-0000(87)90018-3","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"311-320","source":"Crossref","is-referenced-by-count":7,"title":["On commutative context-free languages"],"prefix":"10.1016","volume":"35","author":[{"given":"J.","family":"Beauquier","sequence":"first","affiliation":[]},{"given":"M.","family":"Blattner","sequence":"additional","affiliation":[]},{"given":"M.","family":"Latteux","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(87)90018-3_BIB1","unstructured":"M. Fliess, personal communication, 1970."},{"key":"10.1016\/0022-0000(87)90018-3_BIB2","series-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/0022-0000(87)90018-3_BIB3","series-title":"Algebraic and Automata-Theoretic Properties of Formal Languages","author":"Ginsburg","year":"1975"},{"key":"10.1016\/0022-0000(87)90018-3_BIB4","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0022-0000(87)90018-3_BIB5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(71)90013-5","article-title":"The solution to a problem by Ginsburg","volume":"1","author":"Maurer","year":"1971","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(87)90018-3_BIB6","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0019-9958(72)90821-2","article-title":"On permuting letters of words in context-free languages","volume":"20","author":"Oshiba","year":"1972","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(87)90018-3_BIB7","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","article-title":"On context-free languages","volume":"13","author":"Parikh","year":"1966","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(87)90018-3_BIB8","first-page":"597","article-title":"Sur la fermeture commutative des C-langages","volume":"265","author":"Perrot","year":"1967"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000087900183?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000087900183?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:53:40Z","timestamp":1550325220000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000087900183"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["0022000087900183"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(87)90018-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}