{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:07Z","timestamp":1725664687923},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602491"},{"type":"electronic","value":"9783540447702"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60249-6_47","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:57:17Z","timestamp":1330261037000},"page":"146-155","source":"Crossref","is-referenced-by-count":0,"title":["Efficient rewriting in cograph trace monoids"],"prefix":"10.1007","author":[{"given":"Michael","family":"Bertol","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(88)90051-5","volume":"60","author":"I.J. Aalbersberg","year":"1988","unstructured":"I.J. Aalbersberg and G. Rozenberg. Theory of traces. Theoretical Computer Science, 60:1\u201382, 1988.","journal-title":"Theoretical Computer Science"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"A.V. Aho Algorithms for finding patterns in strings Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, Elsevier 1990","DOI":"10.1016\/B978-0-444-88071-0.50010-2"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/322290.322301","volume":"29","author":"R. Book","year":"1982","unstructured":"R. Book. Confluent and other types of Thue systems. J. Assoc. Comput. Mach., 29:171\u2013182, 1982.","journal-title":"J. Assoc. Comput. Mach."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"P. Cartier and D. Foata. Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements. Lecture Notes in Mathematics 85. Springer, 1969.","DOI":"10.1007\/BFb0079468"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"V. Diekert and G. Rozenberg. The Book of Traces. World Scientific, 1995.","DOI":"10.1142\/2563"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"V. Diekert. Combinatorics on Traces. Number 454 in Lecture Notes in Computer Science. Springer, 1990.","DOI":"10.1007\/3-540-53031-2"},{"key":"10_CR7","volume-title":"DAIMI Rep. PB 78","author":"A. Mazurkiewicz","year":"1977","unstructured":"A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz. Trace theory. In W. Brauer et al., editors, Petri Nets, Applications and Relationship to other Models of Concurrency, number 255 in Lecture Notes in Computer Science, pages 279\u2013324, Springer, 1987.","DOI":"10.1007\/3-540-17906-2_30"},{"issue":"1","key":"10_CR9","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"},{"issue":"2","key":"10_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"},{"issue":"2","key":"10_CR11","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"},{"key":"10_CR12","first-page":"17","volume":"16","author":"E.S. Wolk","year":"1965","unstructured":"E.S. Wolk. A note on \u201cThe comparabitily graph of a tree\u201d. Amer. Math. Soc., 16:17\u201322, 1965.","journal-title":"Amer. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60249-6_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T04:34:04Z","timestamp":1640925244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60249-6_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602491","9783540447702"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-60249-6_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}