{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:12:41Z","timestamp":1742911961239,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531310"},{"type":"electronic","value":"9783662531327"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53132-7_21","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T21:25:06Z","timestamp":1468963506000},"page":"256-267","source":"Crossref","is-referenced-by-count":4,"title":["The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids"],"prefix":"10.1007","author":[{"given":"Dietrich","family":"Kuske","sequence":"first","affiliation":[]},{"given":"Olena","family":"Prianychnykova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Cori, P., Perrin, D.: Automates et commutations partielles. R.A.I.R.O. Informatique Th\u00e9orique et Applications 19, 21\u201332 (1985)","DOI":"10.1051\/ita\/1985190100211"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-53031-2","volume-title":"Combinatorics on Traces","author":"V Diekert","year":"1990","unstructured":"Diekert, V.: Combinatorics on Traces. LNCS, vol. 454. Springer, Heidelberg (1990)"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"STACS 95","author":"V Diekert","year":"1995","unstructured":"Diekert, V., Muscholl, A., Reinhardt, K.: On codings of traces. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900. Springer, Heidelberg (1995)"},{"key":"21_CR4","doi-asserted-by":"crossref","DOI":"10.1142\/2563","volume-title":"The Book of Traces","author":"V Diekert","year":"1995","unstructured":"Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific Publ. Co., River Edge (1995)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Kuske, D., Prianychnykova, O.: The trace monoids in the queue monoid and in the direct product of two free monoids. arXiv:1603.07217 (2016)","DOI":"10.1007\/978-3-662-53132-7_21"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/978-3-662-44522-8_29","volume-title":"Mathematical Foundations of Computer Science 2014","author":"M Huschenbett","year":"2014","unstructured":"Huschenbett, M., Kuske, D., Zetzsche, G.: The monoid of queue actions. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 340\u2013351. Springer, Heidelberg (2014)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Huschenbett, M., Kuske, D., Zetzsche, G.: The monoid of queue actions (2016, submitted)","DOI":"10.1007\/s00233-016-9835-4"},{"issue":"1\u20133","key":"21_CR8","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.tcs.2003.08.004","volume":"310","author":"M Kunc","year":"2004","unstructured":"Kunc, M.: Undecidability of the trace coding problem and some decidable cases. Theor. Comput. Sci. 310(1\u20133), 393\u2013456 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretation. Technical report, DAIMI Report PB-78, Aarhus University (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"21_CR10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0095-8956(74)90063-X","volume":"16","author":"D Seinsche","year":"1974","unstructured":"Seinsche, D.: On a property of the class of $$n$$ -colorable graphs. J. Comb. Theory\u00a0(B) 16, 191\u2013193 (1974)","journal-title":"J. Comb. Theory\u00a0(B)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53132-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T07:27:55Z","timestamp":1568186875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53132-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531310","9783662531327"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53132-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}