{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:13Z","timestamp":1725663673520},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577850"},{"type":"electronic","value":"9783540483328"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57785-8_154","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:19:29Z","timestamp":1330262369000},"page":"353-364","source":"Crossref","is-referenced-by-count":3,"title":["Coding with traces"],"prefix":"10.1007","author":[{"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"first","affiliation":[]},{"given":"Clelia","family":"Felice","sequence":"additional","affiliation":[]},{"given":"Giovanna","family":"Guaiana","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02088289","volume":"22","author":"I.J. Aalbersberg","year":"1989","unstructured":"I.J. Aalbersberg, H.J. Hoogeboom, Characterizations of the decidability of some problems for regular trace languages, Math. Systems Theory 22 (1989) 1\u201319.","journal-title":"Math. Systems Theory"},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(88)90051-5","volume":"60","author":"I.J. Aalbersberg","year":"1988","unstructured":"I.J. Aalbersberg, G. Rozenberg, Theory of traces, Theoret. Comput. Sci. 60 (1988) 1\u201382.","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0020-0190(84)90020-6","volume":"18","author":"A. Apostolico","year":"1984","unstructured":"A. Apostolico, R. Giancarlo, Pattern matching machine implementation of a fast test for unique decipherability, Information Processing Letters 18 (1984) 155\u2013158.","journal-title":"Information Processing Letters"},{"key":"28_CR4","volume-title":"Theory of Codes","author":"J. Berstel","year":"1985","unstructured":"J. Berstel, D. Perrin, Theory of Codes, Academic Press, New York, 1985."},{"key":"28_CR5","volume-title":"Extremal Graph Theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"B. Bollob\u00e1s, Extremal Graph Theory, Academic Press, New York, 1978."},{"unstructured":"V. Bruy\u00e8re, C. De Felice, G. Guaiana, Decidability for coding between trace monoids, in preparation (1993).","key":"28_CR6"},{"key":"28_CR7","first-page":"43","volume":"30","author":"R.M. Capocelli","year":"1986","unstructured":"R.M. Capocelli, Comments on \u201cTrends in the Theory of Codes\u201d by J. Berstel and D. Perrin, Bull. EATCS 30 (1986) 43\u201344.","journal-title":"Bull. EATCS"},{"key":"28_CR8","volume-title":"Lecture Notes in Mathematics 85","author":"P. Cartier","year":"1969","unstructured":"P. Cartier, D. Foata, Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements, Lecture Notes in Mathematics 85, Springer, Berlin Heidelberg New-York (1969)."},{"unstructured":"C. Choffrut, Free partially commutative monoids, Technical report 86\u201320, LITP, Universit\u00e9 Paris 7 (1986).","key":"28_CR9"},{"key":"28_CR10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.3233\/FI-1987-10305","volume":"10","author":"M. Chrobak","year":"1987","unstructured":"M. Chrobak, W. Rytter, Unique decipherability for partially commutative alphabets, Fundamenta Informaticae 10 (1987) 323\u2013336.","journal-title":"Fundamenta Informaticae"},{"key":"28_CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(85)90013-1","volume":"35","author":"R. Cori","year":"1985","unstructured":"R. Cori, Y. M\u00e9tivier, Recognizable subsets of some partially abelian monoids, Theoret. Comput. Sci. 35 (1985) 241\u2013254.","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1985190100211","volume":"19","author":"R. Cori","year":"1985","unstructured":"R. Cori, D. Perrin, Automates et commutations partielles, RAIRO, Inform. Th\u00e9or. 19 (1985) 21\u201332.","journal-title":"RAIRO, Inform. Th\u00e9or."},{"key":"28_CR13","first-page":"479","volume":"40","author":"V. Diekert","year":"1990","unstructured":"V. Diekert, Research topics in the theory of free partially commutative monoids, Bulletin of EATCS 40 (1990) 479\u2013491.","journal-title":"Bulletin of EATCS"},{"key":"28_CR14","volume-title":"Lecture Notes in Comput. Sci. 454","author":"V. Diekert","year":"1990","unstructured":"V. Diekert, Combinatorics on traces, Lecture Notes in Comput. Sci. 454, Springer, Berlin Heidelberg New-York (1990)."},{"unstructured":"V. Diekert, G. Rozenberg Tracebook, to appear (1993).","key":"28_CR15"},{"unstructured":"C. Duboc, Commutations dans les mono\u00cfdes libres: un cadre th\u00e9orique pour l'\u00e9tude du parall\u00e9lisme, th\u00e8se, Universit\u00e9 de Rouen (1986).","key":"28_CR16"},{"key":"28_CR17","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, Theoret. Comput. Sci. 46 (1986) 159\u2013174.","journal-title":"Theoret. Comput. Sci."},{"unstructured":"E. Galvin, J. L. Peterson, A. Silberschatz, Operating System Concept, Addison Wesley Publishing Company, 1991.","key":"28_CR18"},{"key":"28_CR19","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L. Lovasz","year":"1972","unstructured":"L. Lovasz, Normal hypergraphs and the perfect graph conjecture, Discr. Math. 2 (1972) 253\u2013267.","journal-title":"Discr. Math."},{"key":"28_CR20","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)."},{"doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz, Trace theory, in W. Brauer et al. Ed., Petri Nets, applications and relationship to other models of concurrency, Lecture Notes in Comput. Sci. 255 (1987) 279\u2013324.","key":"28_CR21","DOI":"10.1007\/3-540-17906-2_30"},{"key":"28_CR22","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/BFb0035858","volume":"294","author":"E. Ochmanski","year":"1988","unstructured":"E. Ochmanski, On morphisms of trace monoids, Proc. STACS 88, Lecture Notes Comput. Sci. 294 (1988) 346\u2013355.","journal-title":"Lecture Notes Comput. Sci."},{"key":"28_CR23","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1007\/BFb0035789","volume":"372","author":"D. Perrin","year":"1989","unstructured":"D. Perrin, Partial commutations, Lecture Notes Comput. Sci. 372 (1989) 637\u2013651.","journal-title":"Lecture Notes Comput. Sci."},{"key":"28_CR24","volume-title":"Introduction to Computer Engineering","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata, Introduction to Computer Engineering, Harper and Row, New York, 1985."},{"key":"28_CR25","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1109\/TIT.1982.1056535","volume":"28","author":"M. Rodeh","year":"1982","unstructured":"M. Rodeh, A fast test for unique decipherability based on suffix trees, IEEE Trans. Inform. Theory 28 (1982) 648\u2013651.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"28_CR26","first-page":"104","volume":"8","author":"A.A. Sardinas","year":"1953","unstructured":"A.A. Sardinas, C.W. Patterson, A necessary and sufficient condition for the unique decomposition of coded messages, IRE Internat. Conv. Rec. 8 (1953) 104\u2013108.","journal-title":"IRE Internat. Conv. Rec."}],"container-title":["Lecture Notes in Computer Science","STACS 94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57785-8_154.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T05:42:52Z","timestamp":1640929372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57785-8_154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577850","9783540483328"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-57785-8_154","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}