{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:33Z","timestamp":1725664173611},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590422"},{"type":"electronic","value":"9783540491750"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59042-0_90","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:59:22Z","timestamp":1330257562000},"page":"385-396","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On codings of traces"],"prefix":"10.1007","author":[{"given":"Volker","family":"Diekert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Reinhardt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(91)90224-6","volume":"38","author":"C. \u00c0lvarez","year":"1991","unstructured":"C. \u00c0lvarez and J. Gabarr\u00f3. The parallel complexity of two problems on concurrency. Information Processing Letters, 38:61\u201370, 1991.","journal-title":"Information Processing Letters"},{"key":"34_CR2","unstructured":"V. Bruy\u00e8re and C. De Felice. Coding and Strong Coding in Trace Monoids. This volume."},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"V. Bruy\u00e8re, C. De Felice, and G. Guaiana. Coding with traces. In Proc. of STACS'94, LNCS 775, pp. 353\u2013364. Springer, 1994.","DOI":"10.1007\/3-540-57785-8_154"},{"key":"34_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":"34_CR5","first-page":"241","volume":"35","author":"M. Clerbout","year":"1985","unstructured":"M. Clerbout and M. Latteux. Partial commutations and faithful rational transductions. Theoretical Computer Science, 35:241\u2013254, 1985.","journal-title":"Theoretical Computer Science"},{"key":"34_CR6","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D. G. Corneil","year":"1981","unstructured":"D. G. Corneil, H. Lerchs, and L. Stewart Burlingham. Complement reducible graphs. Discrete Appl. Math., 3:163\u2013174, 1981.","journal-title":"Discrete Appl. Math."},{"key":"34_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1985190100211","volume":"19","author":"R. Cori","year":"1985","unstructured":"R. Cori and D. Perrin. Automates et commutations partielles. R.A.I.R.O.-Informatique Th\u00e9orique et Applications, 19:21\u201332, 1985.","journal-title":"R.A.I.R.O.-Informatique Th\u00e9orique et Applications"},{"key":"34_CR8","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D. G. Corneil","year":"1985","unstructured":"D. G. Corneil, Y. Pearl, and L. K. Stewart. A linear recognition algorithm for cographs. SIAM Journal of Computing, 14:926\u2013934, 1985.","journal-title":"SIAM Journal of Computing"},{"key":"34_CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.3233\/FI-1987-10305","volume":"X","author":"M. Chrobak","year":"1987","unstructured":"M. Chrobak and W. Rytter. Unique decipherability for partially commutative alphabets. Fundamenta Informaticae, X:323\u2013336, 1987.","journal-title":"Fundamenta Informaticae"},{"key":"34_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(90)90003-Z","volume":"74","author":"V. Diekert","year":"1990","unstructured":"V. Diekert. Word problems over traces which are solvable in linear time. Theoretical Computer Science, 74:3\u201318, 1990.","journal-title":"Theoretical Computer Science"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"V. Diekert. Combinatorics on Traces. LNCS 454. Springer, 1990.","DOI":"10.1007\/3-540-53031-2"},{"volume-title":"The Book of Traces","year":"1995","key":"34_CR12","unstructured":"V. Diekert and G. Rozenberg, eds. The Book of Traces. World Scientific, Singapore, 1995. To appear."},{"key":"34_CR13","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0304-3975(86)90028-9","volume":"46","author":"C. Duboc","year":"1986","unstructured":"C. Duboc. On some equations in free partially commutative monoids. Theoretical Computer Science, 46:159\u2013174, 1986.","journal-title":"Theoretical Computer Science"},{"key":"34_CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M. Garey","year":"1978","unstructured":"M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, 1978."},{"key":"34_CR15","volume-title":"Automatentheorie und Formale Sprachen, Band III","author":"G. Hotz","year":"1972","unstructured":"G. Hotz and V. Claus. Automatentheorie und Formale Sprachen, Band III. Bibliographisches Institut, Mannheim, 1972."},{"key":"34_CR16","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0890-5401(92)90060-S","volume":"101","author":"K. Hashiguchi","year":"1992","unstructured":"K. Hashiguchi and K. Yamada. String matching problems over free partially commutative monoids. Information and Computation, 101:131\u2013149, 1992.","journal-title":"Information and Computation"},{"key":"34_CR17","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321765.321782","volume":"20","author":"R. Keller","year":"1973","unstructured":"R. Keller. Parallel program schemata and maximal parallelism I. Fundamental results. Journal of the ACM, 20:514\u2013537, 1973.","journal-title":"Journal of the ACM"},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz. Trace theory. In Petri Nets, Applications and Relationship to other Models of Concurrency, LNCS 255. Springer, 1987.","DOI":"10.1007\/3-540-17906-2_30"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"E. Ochma\u0144ski. On morphisms of trace monoids. In Proc. of STACS'88, LNCS 294, pp. 346\u2013355. Springer, 1988.","DOI":"10.1007\/BFb0035858"}],"container-title":["Lecture Notes in Computer Science","STACS 95"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_90","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T03:55:42Z","timestamp":1640922942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_90"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_90","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}