{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:07Z","timestamp":1759638967304},"reference-count":22,"publisher":"EDP Sciences","issue":"4-6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1998]]},"DOI":"10.1051\/ita\/1998324-601751","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T14:56:12Z","timestamp":1486047372000},"page":"175-198","source":"Crossref","is-referenced-by-count":15,"title":["Shuffle binoids"],"prefix":"10.1051","volume":"32","author":[{"given":"S. L.","family":"Bloom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z.","family":"\u00c9sik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"[Blo76] BLOOM S. L., Varieties of ordered algebras. Journal of Computer and System Sciences, Vol. 45, 1976, pp. 200-212.4272040337.06008","DOI":"10.1016\/S0022-0000(76)80030-X"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"[B\u00c995] BLOOM S. L. and \u00c9SIK Z., Nonfinite axiomatizability of shuffle inequalities. In Proceedings of TAPSOFT'95, volume 915 of Lecture Notes in Computer Science, 1995, pp. 318-333.","DOI":"10.1007\/3-540-59293-8_204"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"[B\u00c996] BLOOM S. L. and \u00c9SIK Z., Free shuffle algebras in language varieties. Theoretical Computer Science, Vol. 163, 1996, pp. 55-98.14070150874.68171","DOI":"10.1016\/0304-3975(95)00230-8"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"[B\u00c997] BLOOM S. L. and \u00c9SIK Z., Axiomatizing shuffle and concatenation in languages. Information and Computation, Vol. 139, 1997, pp. 62-91.14829610892.68055","DOI":"10.1006\/inco.1997.2665"},{"key":"R5","unstructured":"[B\u00c9St] BLOOM S. L., \u00c9SIK Z. and STEFANESCU Gh., Equational theories of relations and regular sets. In Proc. of Words, Languages and Combinatorics, II, M. ITO and M. J\u00dcRGENSEN Eds., Kyoto, 1992 World Scientific, 1994, pp. 40-48.13512780874.08002"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"[Bof90] BOFFA M., Une remarque sur les syst\u00e8mes complets d'identit\u00e9s rationnelles, Theoret. Inform. Appl., Vol. 24, 1990, pp. 419-423.9236610797230701.68059","DOI":"10.1051\/ita\/1990240404191"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"[Bof95] BOFFA M., Une condition impliquant toutes les identit\u00e9s rationnelles, Theoret. Inform. Appl., Vol. 29, 1995, pp. 515-518.9252213770290881.68071","DOI":"10.1051\/ita\/1995290605151"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"[\u00c9B95] Esik Z. and BERN\u00c1TSKY L., Scott induction and equational proofs, in: Mathematical Foundations of Programming Semantics'95, ENTCS, Vol. 1, 1995.14868470910.68129","DOI":"10.1016\/S1571-0661(04)80009-4"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"[\u00c9Brt95] \u00c9SIK Z. and BERTOL M., Nonfinite axiomatizability of the equational theory of shuffle. In Proceedings of ICALP 95, volume 944 of Lecture Notes in Computer Science, 1995, pp. 27-38.1466455","DOI":"10.1007\/3-540-60084-1_60"},{"key":"R10","unstructured":"[\u00c9s98] \u00c9SIK Z., Group axioms for iteration, Information and Computation, to appear.16743070924.68143"},{"key":"R11","unstructured":"[Gis84] GISCHER J. L., Partial Orders and the Axiomatic Theory of Shuffle. PhD thesis, Stanford University, Computer Science Dept., 1984."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"[Gis88] GISCHER J. L., The equational theory of pomsets. Theoretical Computer Science, Vol. 61, 1988, pp. 199-224.9802420669.68015","DOI":"10.1016\/0304-3975(88)90124-7"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"[Gra81] GRABOWSKI J., On partial languages. Fundamenta Informatica, Vol. IV(2), 1981, pp. 427-498.6452490468.68088","DOI":"10.3233\/FI-1981-4210"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"[Koz94] KOZEN D., A completeness theorem for Kleene algebras and the algebra of regular events, Information and Computation, Vol. 110, 1994, pp. 366-390.12767410806.68082","DOI":"10.1006\/inco.1994.1037"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"[Kr91] KROB D., Complete Systems of B-rational identities, Theoretical Computer Science, Vol. 89, 1991, pp. 207-343.11336220737.68053","DOI":"10.1016\/0304-3975(91)90395-I"},{"key":"R16","unstructured":"[Kuc90] KUCERA L., Combinatorial Algorithms, Adam Hilger (Bristol and Philadelphia), 1990.11004750731.68084"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"[Pra86] PRATT V., Modeling concurrency with partial orders. Internat. J. Parallel Processing, Vol. 15, 1986, pp. 33-71.8679680622.68034","DOI":"10.1007\/BF01379149"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"[WT90] THOMAS W., Automata on infinite objects. In Handbook of Theoretical Computer Science, Vol. B, Formal Models and Semantics, MIT Press, 1990, pp. 133-192.11271890900.68316","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"[Tsc94] TSCHANTZ Steven T., Languages under concatenation and shuffling, Mathematical Structures in Computer Science, Vol. 4, 1994, pp. 505-511.13221850829.68077","DOI":"10.1017\/S0960129500000578"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"[VTL81] VALDES J., TARJAN R. E. and LAWLER E. L., The recognition of series-parallel digraphs. SIAM Journal of Computing, Vol. 11(2), 1981, pp. 298-313.6529040478.68065","DOI":"10.1137\/0211023"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"[Wil93] WILKE T., An algebraic theory for regular languages of finite and infinite words. International Journal of Algebra and Computation, Vol. 3, 1993, pp. 447-489.12502470791.68116","DOI":"10.1142\/S0218196793000287"},{"key":"R22","doi-asserted-by":"crossref","unstructured":"[Wil91] WILKE T., An Eilenberg Theorem for \u221e-languages. In \"Automata, Languages and Programming\", Proc. of 18th ICALP Conference, Vol. 510 of Lecture Notes in Computer Science, 1991, pp. 588-599.11299380766.68083","DOI":"10.1007\/3-540-54233-7_166"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1998324-601751\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T08:20:32Z","timestamp":1658564432000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1998324-601751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":22,"journal-issue":{"issue":"4-6"},"alternative-id":["ita1998324-601751"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1998324-601751","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}