{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:07:47Z","timestamp":1760202467427},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":4580,"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":[[2001,1]]},"DOI":"10.1016\/s0304-3975(99)00109-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:32:23Z","timestamp":1027607543000},"page":"31-53","source":"Crossref","is-referenced-by-count":36,"title":["Shuffle languages are in P"],"prefix":"10.1016","volume":"250","author":[{"given":"Joanna","family":"J\u0229drzejowicz","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Szepietowski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00109-7_BIB1","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0304-3975(92)90339-H","article-title":"Concurrent regular expressions and their relationship to Petri nets","volume":"96","author":"Garg","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00109-7_BIB2","first-page":"1981","article-title":"Shuffle languages","volume":"Commun. ACM","author":"Gischer","year":"1924","journal-title":"Petri nets and context sensitive grammars"},{"key":"10.1016\/S0304-3975(99)00109-7_BIB3","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(99)00109-7_BIB4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(81)90054-2","article-title":"The power of synchronizing operations on strings","volume":"14","author":"Jantzen","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00109-7_BIB5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(85)90221-X","article-title":"Extending regular operations with iterated shuffle","volume":"38","author":"Jantzen","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00109-7_BIB6","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."},{"key":"10.1016\/S0304-3975(99)00109-7_BIB7","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0020-0190(87)90213-4","article-title":"Nesting of shuffle closure is important","volume":"25","author":"J\u0229drzejowicz","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(99)00109-7_BIB8","unstructured":"J. J\u0229drzejowicz, Shuffle Operation in Formal Languages, Wydawnictwo Uniwersytetu Gdanskiego, 1996."},{"key":"10.1016\/S0304-3975(99)00109-7_BIB9","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1006\/inco.1994.1098","article-title":"The complexity of word problems \u2013 this time with interleaving","volume":"115","author":"Mayer","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00109-7_BIB10","doi-asserted-by":"crossref","unstructured":"W.F. Ogden, W.E. Riddle, C. Rounds, Complexity of expressions allowing concurrency, in: Proc. 5th Ann ACM Symp. on Principles of Programming Languages, 1978, pp. 185\u2013194.","DOI":"10.1145\/512760.512780"},{"key":"10.1016\/S0304-3975(99)00109-7_BIB11","series-title":"Software system modelling and analysis, Tech. Report, Dept. of Computer and Communication Sciences","author":"Riddle","year":"1976"},{"key":"10.1016\/S0304-3975(99)00109-7_BIB12","doi-asserted-by":"crossref","unstructured":"A.C. Shaw, Software descriptions with flow expressions, IEEE Trans. Software Eng. SE-4 (1978) 242\u2013254.","DOI":"10.1109\/TSE.1978.231501"},{"key":"10.1016\/S0304-3975(99)00109-7_BIB13","first-page":"1984","volume":"J. Comput. Systems Sci.","author":"Warmuth","year":"1928","journal-title":"On the complexity of iterated shuffle"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001097?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001097?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T06:30:51Z","timestamp":1556433051000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["S0304397599001097"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00109-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}