{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:10Z","timestamp":1725664330445},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540591757"},{"type":"electronic","value":"9783540492207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59175-3_84","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:05:55Z","timestamp":1330275955000},"page":"99-111","source":"Crossref","is-referenced-by-count":1,"title":["Free shuffle algebras in language varieties extended abstract"],"prefix":"10.1007","author":[{"given":"Stephen L.","family":"Bloom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,6]]},"reference":[{"key":"8_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":"8_CR2","doi-asserted-by":"publisher","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":"8_CR3","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":"8_CR4","unstructured":"S. L. Bloom and Z. \u00c9sik. Nonfinite Axiomatizability of Shuffle Inequalities. To appear in Proceedings of TAPSOFT\/CAAP '95."},{"key":"8_CR5","unstructured":"Z. Esik and M. Bertol. Nonfinite Axiomatizability of the Equational Theory of Shuffle. To appear."},{"issue":"3","key":"8_CR6","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\u2013442, 1993.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"8_CR7","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the theory of NP completeness W. H. Freeman, 1979."},{"key":"8_CR8","unstructured":"Jay Loren Gischer. Partial Orders and the Axiomatic Theory of Shuffle. PhD thesis, Stanford University, Computer Science Dent., 1984."},{"key":"8_CR9","doi-asserted-by":"publisher","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":"8_CR10","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":"8_CR11","volume-title":"Combinatorial Algorithms","author":"L. Kucera","year":"1990","unstructured":"Ludek Kucera. Combinatorial Algorithms Adam Hilger, Bristol and Philadelphia, 1990."},{"key":"8_CR12","unstructured":"A. Meyer and A. Rabinovich. Private communication."},{"issue":"1","key":"8_CR13","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":"8_CR14","doi-asserted-by":"crossref","unstructured":"C. Stirling. Temporal logic for CCS. In G. Rozenberg J.W. de Bakker, W.-P. de Roever, editor, Linear Time, Branching Time and Partial Order in Logics and Models of Concurrency, volume 354 of Lecture Notes in Computer Science, pages 660\u2013672, 1989.","DOI":"10.1007\/BFb0013039"},{"issue":"2","key":"8_CR15","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","LATIN '95: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59175-3_84.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T09:04:38Z","timestamp":1640941478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59175-3_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540591757","9783540492207"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-59175-3_84","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}