{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:30:50Z","timestamp":1742981450302,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319251493"},{"type":"electronic","value":"9783319251509"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25150-9_15","type":"book-chapter","created":{"date-parts":[[2015,9,25]],"date-time":"2015-09-25T11:42:36Z","timestamp":1443181356000},"page":"241-257","source":"Crossref","is-referenced-by-count":0,"title":["Quotients of Unbounded Parallelism"],"prefix":"10.1007","author":[{"given":"Nils Erik","family":"Flick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,25]]},"reference":[{"unstructured":"Baeten, J., Bergstra, J., Klop, J.: An operational semantics for process algebra. Centrum voor Wiskunde en Informatica, Department of Computer Science (1985)","key":"15_CR1"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-21254-3_10","volume-title":"Language and Automata Theory and Applications","author":"M Berglund","year":"2011","unstructured":"Berglund, M., Bj\u00f6rklund, H., H\u00f6gberg, J.: Recognizing shuffled languages. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 142\u2013154. Springer, Heidelberg (2011)"},{"key":"15_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and Context-Free Languages, vol. 4. Teubner, Stuttgart (1979)"},{"issue":"11","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1016\/j.ic.2010.06.002","volume":"208","author":"J Berstel","year":"2010","unstructured":"Berstel, J., Boasson, L., Carton, O., Pin, J.E., Restivo, A.: The expressive power of the shuffle product. Inf. Comput. 208(11), 1258\u20131272 (2010)","journal-title":"Inf. Comput."},{"issue":"1","key":"15_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1006\/inco.1997.2665","volume":"139","author":"SL Bloom","year":"1997","unstructured":"Bloom, S.L., \u00c9sik, Z.: Axiomatizing shuffle and concatenation in languages. Inf. Comput. 139(1), 62\u201391 (1997). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540197926651","journal-title":"Inf. Comput."},{"issue":"4","key":"15_CR6","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"JA Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964). http:\/\/doi.acm.org\/10.1145\/321239.321249","journal-title":"J. ACM"},{"issue":"1\u20134","key":"15_CR7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.3233\/FI-2012-666","volume":"116","author":"G Castiglione","year":"2012","unstructured":"Castiglione, G., Restivo, A.: On the shuffle of star-free languages. Fundam. Inform. 116(1\u20134), 35\u201344 (2012)","journal-title":"Fundam. Inform."},{"issue":"8","key":"15_CR8","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N Dershowitz","year":"1979","unstructured":"Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Comm. ACM 22(8), 465\u2013476 (1979)","journal-title":"Comm. ACM"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-60084-1_60","volume-title":"Automata, Languages and Programming","author":"Z \u00c9sik","year":"1995","unstructured":"\u00c9sik, Z., Bertol, M.: Nonfinite axiomatizability of the equational theory of shuffle. In: F\u00fcl\u00f6p, Z., G\u00e9cseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 27\u201338. Springer, Heidelberg (1995). http:\/\/dx.doi.org\/10.1007\/3-540-60084-1_60"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!. Theor. Comput. Sci. 256(1), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-642-31653-1_40","volume-title":"Developments in Language Theory","author":"NE Flick","year":"2012","unstructured":"Flick, N.E., Kudlek, M.: On a hierarchy of languages with catenation and shuffle. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 452\u2013458. Springer, Heidelberg (2012)"},{"issue":"2","key":"15_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J Hopcroft","year":"1979","unstructured":"Hopcroft, J., Pansiot, J.J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci. 8(2), 135\u2013159 (1979)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"15_CR13","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0304-3975(81)90054-2","volume":"14","author":"M Jantzen","year":"1981","unstructured":"Jantzen, M.: The power of synchronizing operations on strings. TCS 14(2), 127\u2013154 (1981)","journal-title":"TCS"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(85)90221-X","volume":"38","author":"M Jantzen","year":"1985","unstructured":"Jantzen, M.: Extending regular expressions with iterated shuffle. Theor. Comput. Sci. 38, 223\u2013247 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"15_CR15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.3233\/FI-2013-936","volume":"128","author":"M Kudlek","year":"2013","unstructured":"Kudlek, M., Flick, N.E.: A hierarchy of languages with catenation and shuffle. Fundam. Inform. 128(1\u20132), 113\u2013128 (2013)","journal-title":"Fundam. Inform."},{"issue":"1\u20132","key":"15_CR16","doi-asserted-by":"crossref","first-page":"117","DOI":"10.3233\/FI-2014-964","volume":"129","author":"M Kudlek","year":"2014","unstructured":"Kudlek, M., Flick, N.E.: Properties of languages with catenation and shuffle. Fundam. Inform. 129(1\u20132), 117\u2013132 (2014)","journal-title":"Fundam. Inform."},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45523-X_7","volume-title":"Multiset Processing","author":"M Kudlek","year":"2001","unstructured":"Kudlek, M., Mart\u00edn-Vide, C., Paun, G.: Toward a formal macroset theory. In: Calude, C.S., Pun, G., Rozenberg, G., Salomaa, A. (eds.) Multiset Processing. LNCS, vol. 2235, pp. 123\u2013133. Springer, Heidelberg (2001)"},{"key":"15_CR18","series-title":"EATCS monographs on theoretical computer science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, Automata, Languages","author":"W Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS monographs on theoretical computer science. Springer, Heidelberg (1986)"},{"issue":"5","key":"15_CR19","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/BF00267045","volume":"22","author":"M Latteux","year":"1985","unstructured":"Latteux, M., Leguy, B., Ratoandromanana, B.: The family of one-counter languages is closed under quotient. Acta Informatica 22(5), 579\u2013588 (1985)","journal-title":"Acta Informatica"},{"unstructured":"Lipton, R.: The reachability problem requires exponential space. Research Report 62, Department of Computer Science, Yale University, New Haven, Connecticut (1976)","key":"15_CR20"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BFb0036488","volume-title":"Theoretical Computer Science","author":"J\u00c9 Pin","year":"1982","unstructured":"Pin, J.\u00c9., Sakarovitch, J.: Some operations and transductions that preserve rationality. In: Cremers, A.B., Kriegel, H.-P. (eds.) Theoretical Computer Science. LNCS, vol. 145, pp. 277\u2013288. Springer, Heidelberg (1982)"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/3-540-08921-7_99","volume-title":"Mathematical Foundations of Computer Science 1978","author":"PH Starke","year":"1978","unstructured":"Starke, P.H.: Free petri net languages. In: Winkowski, J. (ed.) Mathematical Foundations of Computer Science 1978. LNCS, vol. 64, pp. 506\u2013515. Springer, Heidelberg (1978)"},{"issue":"3","key":"15_CR23","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0022-0000(84)90018-7","volume":"28","author":"MK Warmuth","year":"1984","unstructured":"Warmuth, M.K., Haussler, D.: On the complexity of iterated shuffle. J. Comput. Syst. Sci. 28(3), 345\u2013358 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR24","volume-title":"Entscheidbarkeit bei Petri Netzen \u00dcberblick und Kompendium","author":"H Wimmel","year":"2008","unstructured":"Wimmel, H.: Entscheidbarkeit bei Petri Netzen \u00dcberblick und Kompendium. Springer, Heidelberg (2008)"},{"issue":"3","key":"15_CR25","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0890-5401(87)90032-0","volume":"72","author":"G Winskel","year":"1987","unstructured":"Winskel, G.: Petri nets, algebras, morphisms, and compositionality. Inf. Comput. 72(3), 197\u2013238 (1987)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25150-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T15:00:58Z","timestamp":1692025258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25150-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319251493","9783319251509"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25150-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}