{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:49:36Z","timestamp":1725490176028},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404347"},{"type":"electronic","value":"9783540450078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45007-6_12","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T14:34:37Z","timestamp":1188311677000},"page":"159-170","source":"Crossref","is-referenced-by-count":1,"title":["Generating Series of the Trace Group"],"prefix":"10.1007","author":[{"given":"Anne","family":"Bouillard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Mairesse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"12_CR1","unstructured":"A. Bouillard. Rapport de DEA: Le groupe de traces. LIAFA research report 2002-13, Universit\u00e9 Paris 7, 2002."},{"issue":"1\u20132","key":"12_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0304-3975(99)00151-6","volume":"250","author":"C. Campbell","year":"2001","unstructured":"C. Campbell, E. Robertson, N. Ru\u0161kuc, and R. Thomas. Automatic semigroups. Theoret. Comput. Sci., 250(1\u20132):365\u2013391, 2001.","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"P. Cartier and D. Foata. Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements. Number 85 in Lecture Notes in Mathematics. Springer, 1969.","DOI":"10.1007\/BFb0079468"},{"issue":"1\u20133","key":"12_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0012-365X(98)00211-8","volume":"194","author":"C. Choffrut","year":"1999","unstructured":"C. Choffrut and M. Goldwurm. Determinants and M\u00f6bius functions in trace monoids. Discrete Math., 194(1\u20133):239\u2013247, 1999.","journal-title":"Discrete Math."},{"key":"12_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-53031-2","volume-title":"Combinatorics on traces","author":"V. Diekert","year":"1990","unstructured":"V. Diekert. Combinatorics on traces. Number 454 in LNCS. Springer Verlag, 1990."},{"key":"12_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/3-540-48224-5_45","volume-title":"ICALP\u201901","author":"V. Diekert","year":"2001","unstructured":"V. Diekert and A. Muscholl. Solvability of equations in free partially commutative groups is decidable. In ICALP\u201901, n. 2076 in LNCS, pages 543\u2013554. Springer, 2001."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, 1995.","DOI":"10.1142\/2563"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0012-365X(92)90279-O","volume":"109","author":"C. Droms","year":"1992","unstructured":"C. Droms, B. Servatius, and H. Servatius. Groups assembled from free and direct products. Discrete Math., 109:69\u201375, 1992.","journal-title":"Discrete Math."},{"key":"12_CR9","unstructured":"C. Duboc. Commutations dans les mono\u00efdes libres: un cadre th\u00e9orique pour l\u2019\u00e9tude du parall\u00e9lisme. PhD thesis, Univ. Rouen, 1986."},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1142\/S0218196793000032","volume":"3","author":"G. Duchamp","year":"1993","unstructured":"G. Duchamp and D. Krob. Partially commutative Magnus transformations. Internat. J. Algebra Comput., 3:15\u201341, 1993.","journal-title":"Internat. J. Algebra Comput."},{"key":"12_CR11","doi-asserted-by":"crossref","DOI":"10.1201\/9781439865699","volume-title":"Word processing in groups","author":"D. Epstein","year":"1992","unstructured":"D. Epstein, J. Cannon, D. Holt, S. Levy, M. Paterson, and W. Thurston. Word processing in groups. Jones and Bartlett, Boston, 1992."},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0020-0190(00)00086-7","volume":"75","author":"M. Goldwurm","year":"2000","unstructured":"M. Goldwurm and M. Santini. Clique polynomials have a unique root of smallest modulus. Information Processing Letters, 75(3):127\u2013132, 2000.","journal-title":"Information Processing Letters"},{"key":"12_CR13","unstructured":"G. Hardy and E. Wright. An introduction to the theory of numbers. Oxford at the Clarendon Press, 1979. 5-th edition."},{"key":"12_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/3-540-45841-7_39","volume-title":"Discrete Math.","author":"D. Krob","year":"2002","unstructured":"D. Krob, J. Mairesse, and I. Michos. Computing the average parallelism in trace monoids. Discrete Math., 2002. Accepted for publication. An abridged version appears in STACS\u201902, LNCS 2285, p. 477\u2013488, Springer."},{"key":"12_CR15","volume-title":"Semigroups and Combinatorial Applications","author":"G. Lallement","year":"1979","unstructured":"G. Lallement. Semigroups and Combinatorial Applications. Wiley, New-York, 1979."},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/BF00531932","volume":"2","author":"G.-C. Rota","year":"1964","unstructured":"G.-C. Rota. On the foundations of combinatorial theory. I. Theory of M\u00f6bius functions. Z. Wahrscheinlichkeitstheor. Verw. Geb., 2:340\u2013368, 1964.","journal-title":"Z. Wahrscheinlichkeitstheor. Verw. Geb."},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s002200000221","volume":"212","author":"A. Vershik","year":"2000","unstructured":"A. Vershik, S. Nechaev, and R. Bikbov. Statistical properties of locally free groups with applications to braid groups and growth of random heaps. Commun. Math. Phys., 212(2):469\u2013501, 2000.","journal-title":"Commun. Math. Phys."},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"G.X. Viennot. Heaps of pieces, I: Basic definitions and combinatorial lemmas. In Labelle and Leroux, editors, Combinatoire \u00c9num\u00e9rative, number 1234 in Lect. Notes in Math., pages 321\u2013350. Springer, 1986.","DOI":"10.1007\/BFb0072524"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45007-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:09:06Z","timestamp":1556816946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45007-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404347","9783540450078"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45007-6_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}