{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:41Z","timestamp":1759637801432},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":3942,"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":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00389-9","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T16:25:18Z","timestamp":1034007918000},"page":"705-725","source":"Crossref","is-referenced-by-count":18,"title":["Conway's problem for three-word sets"],"prefix":"10.1016","volume":"289","author":[{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ion","family":"Petre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00389-9_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. Am. Math. Soc."},{"key":"10.1016\/S0304-3975(01)00389-9_BIB2","series-title":"Handbook of Formal Languages, Vol. 1","first-page":"329","article-title":"Combinatorics on words","author":"Choffrut","year":"1997"},{"key":"10.1016\/S0304-3975(01)00389-9_BIB3","doi-asserted-by":"crossref","unstructured":"C. Choffrut, J. Karhum\u00e4ki, On Fatou properties of rational languages, in: C. Martin-Vide, V. Mitrana (Eds.), Where mathematics, Computer Science, Linguistics and Biology Meet, Kluwer, 2000.","DOI":"10.1007\/978-94-015-9634-3_20"},{"key":"10.1016\/S0304-3975(01)00389-9_BIB4","unstructured":"C. Choffrut, J. Karhum\u00e4ki, N. Ollinger, The commutation of finite sets: a challenging problem, TUCS Technical Report 303, (http:\/\/www.tucs.fi\/), 1999, special issue on Words\u201999 of Theoret. Comput. Sci., to appear."},{"key":"10.1016\/S0304-3975(01)00389-9_BIB5","doi-asserted-by":"crossref","unstructured":"P.M. Cohn, Factorization in noncommuting power series rings, Proc. Cambridge Philos. Soc. 58 (1962) 452\u2013464.","DOI":"10.1017\/S0305004100036720"},{"key":"10.1016\/S0304-3975(01)00389-9_BIB6","series-title":"Regular Algebra and Finite Machines","author":"Conway","year":"1971"},{"key":"10.1016\/S0304-3975(01)00389-9_BIB7","series-title":"Automata, Languages and Machines","author":"Eilenberg","year":"1974"},{"key":"10.1016\/S0304-3975(01)00389-9_BIB8","unstructured":"L. Kari, On insertion and deletion in formal languages, Ph.D. Thesis, University of Turku, 1991."},{"key":"10.1016\/S0304-3975(01)00389-9_BIB9","doi-asserted-by":"crossref","unstructured":"J. Karhum\u00e4ki, I. Petre, On the centralizer of a finite set, Proc. ICALP 2000, Lecture Notes in Computer Science, Vol. 1853, 2000, Springer, Berlin, pp. 536\u2013546.","DOI":"10.1007\/3-540-45022-X_45"},{"key":"10.1016\/S0304-3975(01)00389-9_BIB10","first-page":"171","article-title":"Conway's problem and the commutation of languages","volume":"74","author":"Karhum\u00e4ki","year":"2001","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0304-3975(01)00389-9_BIB11","series-title":"Language Equations","author":"Leiss","year":"1998"},{"key":"10.1016\/S0304-3975(01)00389-9_BIB12","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/S0304-3975(01)00389-9_BIB13","doi-asserted-by":"crossref","unstructured":"M. Lothaire, Algebraic Combinatorics on Words, Cambridge University Press, Cambridge, to appear, 2002.","DOI":"10.1017\/CBO9781107326019"},{"key":"10.1016\/S0304-3975(01)00389-9_BIB14","unstructured":"A. Mateescu, A. Salomaa, S. Yu, On the decomposition of finite languages, Technical Report 222, TUCS, (http:\/\/www.tucs.fi\/), 1998."},{"issue":"4","key":"10.1016\/S0304-3975(01)00389-9_BIB15","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003899?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003899?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T20:25:25Z","timestamp":1578428725000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003899"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501003899"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00389-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}