{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:04Z","timestamp":1725664204872},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600848"},{"type":"electronic","value":"9783540494256"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60084-1_60","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:38:40Z","timestamp":1330277920000},"page":"27-38","source":"Crossref","is-referenced-by-count":4,"title":["Nonfinite axiomatizability of the equational theory of shuffle"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00e9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Bertol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"L. Aceto. Full abstraction for series-parallel pomsets. In Proceedings of TAPSOFT '91, volume 493 of Lecture Notes in Computer Science, pages 1\u201340. Springer-Verlag, 1991.","DOI":"10.1007\/3-540-53982-4_1"},{"issue":"2","key":"3_CR2","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1006\/inco.1993.1019","volume":"103","author":"L. Aceto","year":"1993","unstructured":"L. Aceto and M. Hennessy. Towards action refinement in process algebras. Information and Computation, 103(2):204\u2013269, 1993.","journal-title":"Information and Computation"},{"key":"3_CR3","first-page":"67","volume":"10","author":"K. B. Arkhangelskii","year":"1987","unstructured":"K. B. Arkhangelskii and P. V. Gorshkov. Implicational axioms for the algebra of regular languages. Dokl. Akad. Nauk USSR Ser. A, 10:67\u201369, 1987. (in Russian)","journal-title":"Dokl. Akad. Nauk USSR Ser. A"},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/S0022-0000(76)80030-X","volume":"45","author":"S. L. Bloom","year":"1976","unstructured":"S. L. Bloom. Varieties of ordered algebras. Journal of Computer and System Sciences, 45:200\u2013212, 1976.","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0960129500000104","volume":"3","author":"S. L. Bloom","year":"1993","unstructured":"S. L. Bloom and Z. \u00e9sik. Equational axioms for regular sets. Mathematical Stuctures in Computer Science, 3:1\u201324, 1993.","journal-title":"Mathematical Stuctures in Computer Science"},{"key":"3_CR6","unstructured":"S. L. Bloom and Z. \u00e9sik. Free shuffle algebras in language varieties. Full version submitted for publication. Extended abstract to appear in the proceedings of LATIN '95."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"S. L. Bloom and Z. \u00e9sik. Nonfinite axiomatizability of shuffle inequalities. In: Proceedings of TAPSOFT '95, LNCS 915, Springer-Verlag, 1995, 318\u2013333.","DOI":"10.1007\/3-540-59293-8_204"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1051\/ita\/1990240404191","volume":"24","author":"M. Boffa","year":"1990","unstructured":"M. Boffa. Une remarque sur les syst\u00e8mes complets d'identites rationelles. Theoret. Inform. Appl., 24:419\u2013423, 1990.","journal-title":"Theoret. Inform. Appl."},{"key":"3_CR9","volume-title":"Regular Algebra and Finite Machines","author":"J. Conway","year":"1971","unstructured":"J. Conway. Regular Algebra and Finite Machines. Chapman & Hall, London, 1971."},{"issue":"3","key":"3_CR10","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1137\/0406035","volume":"6","author":"J. Feigenbaum","year":"1993","unstructured":"J. Feigenbaum, J. A. Kahn, C. Lund. Complexity results for pomset languages. SIAM Journal of Discrete Mathematics, 6(3):432\u2013444, 1993.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"3_CR11","unstructured":"Jay Loren Gischer. Partial orders and the axiomatic theory of shuffle. PhD thesis, Stanford University, Computer Science Dept., 1984."},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","volume":"61","author":"J. L. Gischer","year":"1988","unstructured":"Jay Loren Gischer. The equational theory of pomsets. Theoretical Computer Science, 61:199\u2013224, 1988.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"3_CR13","doi-asserted-by":"crossref","first-page":"427","DOI":"10.3233\/FI-1981-4210","volume":"IV","author":"J. Grabowski","year":"1981","unstructured":"Jan Grabowski. On partial languages. Fundamenta Informatica, IV(2):427\u2013498, 1981.","journal-title":"Fundamenta Informatica"},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110:366\u2013390, 1994.","journal-title":"Information and Computation"},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0304-3975(91)90395-I","volume":"89","author":"D. Krob","year":"1991","unstructured":"D. Krob. Complete systems of B-rational identities. Theoretical Computer Science, 89:207\u2013343, 1991.","journal-title":"Theoretical Computer Science"},{"key":"3_CR16","unstructured":"A. Meyer and A. Rabinovich. Private communication."},{"issue":"1","key":"3_CR17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V. Pratt","year":"1986","unstructured":"Vaughan Pratt. Modeling concurrency with partial orders. International Journal of Parallel Processing, 15(1):33\u201371, 1986.","journal-title":"International Journal of Parallel Processing"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Vaughan Pratt. Action structures and pure induction. Technical Report, Stanford University, Dept. of Computer Science, April 1991.","DOI":"10.1007\/BFb0018436"},{"key":"3_CR19","first-page":"120","volume":"16","author":"V. N. Redko","year":"1964","unstructured":"V. N. Redko. On defining relations for the algebra of regular events. Ukrain. Mat. Z., 16:120\u2013126, 1964. (in Russian)","journal-title":"Ukrain. Mat. Z."},{"key":"3_CR20","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"Arto Salomaa. Two complete axiom systems for the algebra of regular events. J. ACM, 13:158\u2013169, 1966.","journal-title":"J. ACM"},{"issue":"2","key":"3_CR21","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1981","unstructured":"J. Valdes, R. E. Tarjan, and E. L. Lawler. The recognition of series-parallel digraphs. SIAM Journal of Computing, 11(2):298\u2013313, 1981.","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60084-1_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T09:22:52Z","timestamp":1640942572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60084-1_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600848","9783540494256"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-60084-1_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}