{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:45:56Z","timestamp":1725493556327},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_50","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T02:29:04Z","timestamp":1193538544000},"page":"603-614","source":"Crossref","is-referenced-by-count":0,"title":["The Trace Coding Problem Is Undecidable"],"prefix":"10.1007","author":[{"given":"Michal","family":"Kunc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"50_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/3-540-59042-0_89","volume-title":"Proc. STACS\u201995","author":"V. Bruy\u00e8re","year":"1995","unstructured":"Bruy\u00e8re, V., De Felice, C.: Coding and strong coding in trace monoids. In Proc. STACS\u201995, LNCS 900, Springer (1995) 373\u2013384."},{"key":"50_CR2","first-page":"87","volume":"4","author":"V. Bruy\u00e8re","year":"1999","unstructured":"Bruy\u00e8re, V., De Felice, C.: On the existence of codings between trace monoids. Journal of Automata, Languages and Combinatorics\n                           4 (1999) 87\u2013100.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"50_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0304-3975(95)00036-V","volume":"148","author":"V. Bruy\u00e8re","year":"1995","unstructured":"Bruy\u00e8re, V., De Felice, C., Guaiana, G.: On some decision problems for trace codings. Theoretical Computer Science\n                           148 (1995) 227\u2013260.","journal-title":"Theoretical Computer Science"},{"key":"50_CR4","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/978-3-642-59126-6_8","volume":"3","author":"V. Diekert","year":"1997","unstructured":"Diekert, V., M\u00e9tivier, Y.: Partial commutation and traces. In Handbook of Formal Languages, Vol. 3, Springer (1997) 457\u2013533.","journal-title":"Handbook of Formal Languages"},{"key":"50_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-61550-4_137","volume-title":"Proc. MFCS\u201996","author":"V. Diekert","year":"1996","unstructured":"Diekert, V., Muscholl, A.: Code problems on traces. In Proc. MFCS\u201996, LNCS 1113, Springer (1996) 2\u201317."},{"key":"50_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-59042-0_90","volume-title":"Proc. STACS\u201995","author":"V. Diekert","year":"1995","unstructured":"Diekert, V., Muscholl, A., Reinhardt, K.: On codings of traces. In Proc. STACS\u201995, LNCS 900, Springer (1995) 385\u2013396."},{"key":"50_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0304-3975(86)90028-9","volume":"46","author":"C. Duboc","year":"1986","unstructured":"Duboc, C.: On some equations in free partially commutative monoids. Theoretical Computer Science\n                           46 (1986) 159\u2013174","journal-title":"Theoretical Computer Science"},{"key":"50_CR8","unstructured":"Kunc, M.: Undecidability of the trace coding problem and some decidable cases. manuscript (2001). \n                    http:\/\/www.math.muni.cz\/~kunc"},{"key":"50_CR9","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus (1977)."},{"key":"50_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/BFb0035858","volume-title":"roc. STACS\u201988","author":"E. Ochma\u0144ski","year":"1988","unstructured":"Ochma\u0144ski, E.: On morphisms of trace monoids. In Proc. STACS\u201988, LNCS 294, Springer (1988) 346\u2013355."}],"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-48224-5_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T13:26:59Z","timestamp":1551014819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_50","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}