{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:19Z","timestamp":1759637599757},"reference-count":5,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1987,7,1]],"date-time":"1987-07-01T00:00:00Z","timestamp":552096000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1987,7]]},"DOI":"10.1016\/0020-0190(87)90213-4","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"363-367","source":"Crossref","is-referenced-by-count":7,"title":["Nesting of shuffle closure is important"],"prefix":"10.1016","volume":"25","author":[{"given":"Joanna","family":"J\u0229drzejowicz","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(87)90213-4_BIB1","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(81)90063-3","article-title":"Relations of flow languages to Petri net languages","volume":"15","author":"Araki","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(87)90213-4_BIB2","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1145\/358746.358767","article-title":"Shuffle languages, Petri nets and context-sensitive grammars","volume":"24","author":"Gischer","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(87)90213-4_BIB3","article-title":"Petri net languages","author":"Hack","year":"1975"},{"key":"10.1016\/0020-0190(87)90213-4_BIB4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(85)90221-X","article-title":"Extending regular expressions with iterated shuffle","volume":"38","author":"Jantzen","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(87)90213-4_BIB5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0190(83)90023-6","article-title":"On the enlargement of the class of regular languages by shuffle closure","volume":"16","author":"J\u0229drzejowicz","year":"1983","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087902134?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087902134?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:55:06Z","timestamp":1553594106000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087902134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,7]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1987,7]]}},"alternative-id":["0020019087902134"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90213-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,7]]}}}