乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:45:17Z","timestamp":1649097917833},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":2968,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2005,6]]},"DOI":"10.1016\/j.tcs.2005.03.037","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T13:53:33Z","timestamp":1113918813000},"page":"322-333","source":"Crossref","is-referenced-by-count":9,"title":["Commutation with codes"],"prefix":"10.1016","volume":"340","author":[{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"first","affiliation":[]},{"given":"Michel","family":"Latteux","sequence":"additional","affiliation":[]},{"given":"Ion","family":"Petre","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2005.03.037_bib1","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1090\/S0002-9947-1969-0236208-5","article-title":"Centralizers in free associative algebras","volume":"137","author":"Bergman","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.tcs.2005.03.037_bib2","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/j.tcs.2005.03.037_bib3","doi-asserted-by":"crossref","unstructured":"C. Choffrut, J. Karhum\u00e4ki, Combinatorics of words, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 1, Springer, Berlin, 1997, pp. 329\u2013438.","DOI":"10.1007\/978-3-642-59136-5_6"},{"key":"10.1016\/j.tcs.2005.03.037_bib4","series-title":"Where Mathematics, Computer Science, Linguistics and Biology Meet","article-title":"On Fatou properties of rational languages","author":"Choffrut","year":"2000"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2005.03.037_bib5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0304-3975(00)00434-5","article-title":"The commutation of finite sets: a challenging problem","volume":"273","author":"Choffrut","year":"2002","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2005.03.037_bib6","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1017\/S0305004100036720","article-title":"Factorization in noncommuting power series rings","volume":"58","author":"Cohn","year":"1962","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"10.1016\/j.tcs.2005.03.037_bib7","unstructured":"P.M. Cohn, Centralisateurs dans les corps libres, in: J. Berstel (Ed.), S\u00e9ries formelles, Paris, 1978, pp. 45\u201354."},{"key":"10.1016\/j.tcs.2005.03.037_bib8","series-title":"Regular Algebra and Finite Machines","author":"Conway","year":"1971"},{"key":"10.1016\/j.tcs.2005.03.037_bib9","first-page":"241","article-title":"Codes and infinite words","volume":"11","author":"Devolder","year":"1994","journal-title":"Acta Cybernet."},{"key":"10.1016\/j.tcs.2005.03.037_bib10","unstructured":"J. Karhum\u00e4ki, Challenges of commutation: an advertisement, in: Proc. of FCT 2001, Lecture Notes in Computer Science, Vol. 2138, Springer, Berlin, 2001, pp. 15\u201323."},{"issue":"2","key":"10.1016\/j.tcs.2005.03.037_bib11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s00224-004-1191-1","article-title":"The commutation with ternary sets of words","volume":"38","author":"Karhum\u00e4ki","year":"2005","journal-title":"Theory Comput. Systems,"},{"key":"10.1016\/j.tcs.2005.03.037_bib12","unstructured":"J. Karhum\u00e4ki, L. Lisovik, The equivalence problem for finite substitutions on ab*c, with applications, IJFCS 14 (2003) 699\u2013710; preliminary version in Springer Lecture Notes in Computer Science, Vol. 2380, 2002, pp. 812\u2013820."},{"key":"10.1016\/j.tcs.2005.03.037_bib13","doi-asserted-by":"crossref","unstructured":"J. Karhum\u00e4ki, I. Petre, On the centralizer of a finite set, in: Proc. of ICALP 2000, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000, 536\u2013546.","DOI":"10.1007\/3-540-45022-X_45"},{"key":"10.1016\/j.tcs.2005.03.037_bib14","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/S0304-3975(01)00389-9","article-title":"Conway's Problem for three-word sets","volume":"289\/1","author":"Karhum\u00e4ki","year":"2002","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2005.03.037_bib15","doi-asserted-by":"crossref","unstructured":"J. Karhum\u00e4ki, I. Petre, Two problems on commutation of languages, in: G. Paun, G. Rozenberg, A. Salomaa (Eds.), Current trends in Theoretical Computer Science (The Challenge of the New Century) Vol. 2, World Scientific 2004, pp. 477\u2013494.","DOI":"10.1142\/9789812562494_0060"},{"key":"10.1016\/j.tcs.2005.03.037_bib16","doi-asserted-by":"crossref","unstructured":"J. Karhum\u00e4ki, I. Petre, The branching point approach to Conway's problem, Lecture Notes in Computer Science, Vol. 2300, Springer, Berlin, 2002, pp. 69\u201376.","DOI":"10.1007\/3-540-45711-9_5"},{"key":"10.1016\/j.tcs.2005.03.037_bib17","doi-asserted-by":"crossref","unstructured":"M. Kunc, Regular solutions of language inequalities and well quasi-orders, in: Proc. of ICALP 2004, Lecture Notes in Computer Science, Vol. 3142, Springer, Berlin, 2004, pp. 870\u2013881; final version in Theoret. Comput. Sci. (2005), to appear.","DOI":"10.1016\/j.tcs.2005.09.018"},{"key":"10.1016\/j.tcs.2005.03.037_bib18","doi-asserted-by":"crossref","unstructured":"M. Kunc, The power of commuting with finite sets of words, Lecture Notes in Computer Science, Vol. 3404, Springer, Berlin, 2005, pp. 569\u2013580.","DOI":"10.1007\/978-3-540-31856-9_47"},{"key":"10.1016\/j.tcs.2005.03.037_bib19","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/j.tcs.2005.03.037_bib20","series-title":"Algebraic Combinatorics on Words","author":"Lothaire","year":"2002"},{"key":"10.1016\/j.tcs.2005.03.037_bib21","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/S0019-9958(72)90406-8","article-title":"Codes conjugu\u00e9s","volume":"20","author":"Perrin","year":"1972","journal-title":"Inform. Control"},{"key":"10.1016\/j.tcs.2005.03.037_bib22","unstructured":"I. Petre, Commutation problems on sets of words and formal power series, Ph.D. Thesis, University of Turku, 2002."},{"issue":"4","key":"10.1016\/j.tcs.2005.03.037_bib23","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1051\/ita\/1989230404251","article-title":"Codes et motifs","volume":"23","author":"Ratoandromanana","year":"1989","journal-title":"RAIRO Inform. Theor."},{"key":"10.1016\/j.tcs.2005.03.037_bib24","doi-asserted-by":"crossref","unstructured":"A. Restivo, Some decision results for recognizable sets in arbitrary monoids, in: Proc. of ICALP 1978, Lecture Notes in Computer Science, Vol. 62, Springer, Berlin, 1978, pp. 363\u2013371.","DOI":"10.1007\/3-540-08860-1_27"},{"key":"10.1016\/j.tcs.2005.03.037_bib25","series-title":"Algebraic Combinatorics on Word","first-page":"312","article-title":"Centralisers of noncommutative series and polynomials","author":"Reutenauer","year":"2002"},{"key":"10.1016\/j.tcs.2005.03.037_bib26","series-title":"Developments in Language Theory","first-page":"22","article-title":"On the decomposition of finite languages","author":"Salomaa","year":"2000"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397505001507?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397505001507?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T02:23:41Z","timestamp":1548555821000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397505001507"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["S0304397505001507"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2005.03.037","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}