{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:45:26Z","timestamp":1725551126144},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540006237"},{"type":"electronic","value":"9783540364948"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36494-3_8","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T17:12:04Z","timestamp":1269882724000},"page":"74-84","source":"Crossref","is-referenced-by-count":5,"title":["The Commutation with Codes and Ternary Sets of Words"],"prefix":"10.1007","author":[{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"first","affiliation":[]},{"given":"Michel","family":"Latteux","sequence":"additional","affiliation":[]},{"given":"Ion","family":"Petre","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,17]]},"reference":[{"issue":"4","key":"8_CR1","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1051\/ita\/1989230403791","volume":"23","author":"J.M. Autebert","year":"1989","unstructured":"Autebert, J.M., Boasson, L., Latteux, M.: Motifs et bases de langages, RAIRO Inform. Theor., 23(4) (1989) 379\u2013393.","journal-title":"RAIRO Inform. Theor."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"327","DOI":"10.2307\/1994807","volume":"137","author":"G. Bergman","year":"1969","unstructured":"Bergman, G.: Centralizers in free associative algebras, Transactions of the American Mathematical Society 137 (1969) 327\u2013344.","journal-title":"Transactions of the American Mathematical Society"},{"key":"8_CR3","volume-title":"Theory of Codes","author":"J. Berstel","year":"1985","unstructured":"Berstel, J., Perrin, D.: Theory of Codes, Academic Press, New York (1985)."},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/978-3-642-59136-5_6","volume":"1","author":"C. Choffrut","year":"1997","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Combinatorics of Words. In Rozenberg, G., Salomaa, A. (eds.), Handbook of Formal Languages, Vol. 1, Springer-Verlag (1997) 329\u2013438.","journal-title":"Handbook of Formal Languages"},{"key":"8_CR5","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: On Fatou properties of rational languages, in Martin-Vide, C., Mitrana, V. (eds.), Where mathematics, Computer Science, Linguistics and Biology Meet, Kluwer, Dordrecht (2000)."},{"issue":"1\u20132","key":"8_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0304-3975(00)00434-5","volume":"273","author":"C. Choffrut","year":"2002","unstructured":"Choffrut, C., Karhum\u00e4ki, J., Ollinger, N.: The commutation of finite sets: a challenging problem, Theoret. Comput. Sci., 273 (1\u20132) (2002) 69\u201379.","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1017\/S0305004100036720","volume":"58","author":"P.M. Cohn","year":"1962","unstructured":"Cohn, P.M.: Factorization in noncommuting power series rings, Proc. Cambridge Philos. Soc. 58 (1962) 452\u2013464.","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"8_CR8","unstructured":"Cohn, P.M.: Centralisateurs dans les corps libres, in Berstel, J. (ed.), S\u2130ies formelles, Paris, (1978) 45\u201354."},{"key":"8_CR9","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines, Chapman Hall (1971)."},{"key":"8_CR10","first-page":"241","volume":"11","author":"J. Devolder","year":"1994","unstructured":"Devolder, J., Latteux, M., Litovsky, I., Staiger, L.: Codes and infinite words, Acta Cybernetica 11 (1994) 241\u2013256.","journal-title":"Acta Cybernetica"},{"key":"8_CR11","unstructured":"Harju, T., Petre, I.: On commutation and primitive roots of codes, submitted. A preliminary version of this paper has been presented at WORDS 2001, Palermo, Italy."},{"key":"8_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-44669-9_3","volume-title":"Challenges of commutation: an advertisement","author":"J. Karhum\u00e4ki","year":"2001","unstructured":"Karhum\u00e4ki, J.: Challenges of commutation: an advertisement, in Proc. of FCT 2001, LNCS 2138, Springer (2001) 15\u201323."},{"key":"8_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1007\/3-540-45022-X_45","volume-title":"On the centralizer of a finite set","author":"J. Karhum\u00e4ki","year":"2000","unstructured":"Karhum\u00e4ki, J., Petre, I.: On the centralizer of a finite set, in Proc. of ICALP 2000, LNCS 1853, Springer (2000) 536\u2013546."},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/S0304-3975(01)00389-9","volume":"289","author":"J. Karhum\u00e4ki","year":"2002","unstructured":"Karhum\u00e4ki, J., Petre, I.: Conway\u2019s Problem for three-word sets, Theoret. Comput. Sci., 289\/1 (2002) 705\u2013725.","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR15","first-page":"171","volume":"74","author":"J. Karhum\u00e4ki","year":"2001","unstructured":"Karhum\u00e4ki, J., Petre, I.: Conway\u2019s problem and the commutation of languages, Bulletin of EATCS 74 (2001) 171\u2013177.","journal-title":"Bulletin of EATCS"},{"key":"8_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/3-540-45711-9_5","volume-title":"The branching point approach to Conway\u2019s problem","author":"J. Karhum\u00e4ki","year":"2002","unstructured":"Karhum\u00e4ki, J., Petre, I.: The branching point approach to Conway\u2019s problem, LNCS 2300, Springer (2002) 69\u201376."},{"key":"8_CR17","unstructured":"Lothaire, M.: Combinatorics on Words (Addison-Wesley, Reading, MA., (1983)."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words (Cambridge University Press), (2002).","DOI":"10.1017\/CBO9781107326019"},{"key":"8_CR19","unstructured":"Mateescu, A., Salomaa, A., Yu, S.: On the decomposition of finite languages, TUCS Technical Report 222, \n http:\/\/www.tucs..\/\n \n (1998)."},{"key":"8_CR20","unstructured":"Petre, I.: Commutation Problems on Sets of Words and Formal Power Series, PhD Thesis, University of Turku (2002)."},{"issue":"4","key":"8_CR21","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1051\/ita\/1989230404251","volume":"23","author":"B. Ratoandromanana","year":"1989","unstructured":"Ratoandromanana, B.: Codes et motifs, RAIRO Inform. Theor., 23(4) (1989) 425\u2013444.","journal-title":"RAIRO Inform. Theor."},{"key":"8_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/3-540-08860-1_27","volume-title":"Some decision results for recognizable sets in arbitrary monoids","author":"A. Restivo","year":"1978","unstructured":"Restivo, A.: Some decision results for recognizable sets in arbitrary monoids, in Proc. of ICALP 1978, LNCS 62 Springer (1978) 363\u2013371."},{"key":"8_CR23","unstructured":"Shyr, H.J.: Free monoids and languages, Hon Min Book Company, (1991)."}],"container-title":["Lecture Notes in Computer Science","STACS 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36494-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T03:55:03Z","timestamp":1550980503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36494-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540006237","9783540364948"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-36494-3_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}