{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:08Z","timestamp":1725488588928},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_3","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:32:26Z","timestamp":1186741946000},"page":"15-23","source":"Crossref","is-referenced-by-count":4,"title":["Challenges of Commutation"],"prefix":"10.1007","author":[{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"327","DOI":"10.2307\/1994807","volume":"137","author":"G. Bergman","year":"1969","unstructured":"G. Bergman, Centralizers in free associative algebras, Trans. Amer. Math. Soc. 137, 327\u2013344, 1969.","journal-title":"Trans. Amer. Math. Soc."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"C. Choffrut and J. Karhum\u00e4ki, Combinatorics of Words, In: G. Rozenberg and A. Salomaa (eds), Handbook of Formal Languages, vol. 1, 329\u2013438, Springer, 1997.","DOI":"10.1007\/978-3-642-59136-5_6"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"C. Choffrut, J. Karhum\u00e4ki and N. Ollinger, The commutation of finite sets: a challenging problem, Theoret. Comput. Sci., to appear.","DOI":"10.1016\/S0304-3975(00)00434-5"},{"key":"3_CR4","unstructured":"P. M. Cohn, Centralizateurs dans les corps libre, In: J. Berstel (ed.), S\u00e9ries Formelles 45\u201354, Paris, 1978."},{"key":"3_CR5","unstructured":"J. H. Conway, Regular Algebra and Finite Machines, Chapman Hall, 1971."},{"key":"3_CR6","unstructured":"K. Culik II and J. Karhum\u00e4ki, manuscript, in preparation."},{"key":"3_CR7","unstructured":"T. Harju, O. Ibarra, J. Karhum\u00e4ki and A. Salomaa, Decision problems concerning semilinearity, morphisms and commutation of languages, Proceedings of ICALP01, to appear."},{"key":"3_CR8","unstructured":"T. Harju and I. Petre, On commutation and primitive roots of codes, manuscript."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"3","author":"G. Higman","year":"1952","unstructured":"G. Higman, Ordering with divisibility in abstract algebras, Proc. London Math. Soc. 3, 326\u2013336, 1952.","journal-title":"Proc. London Math. Soc."},{"key":"3_CR10","unstructured":"M. Hirvensalo, personal commutation."},{"key":"3_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1007\/3-540-45022-X_45","volume-title":"Theoret. Comput. Sci.","author":"J. Karhum\u00e4ki","year":"2000","unstructured":"J. Karhum\u00e4ki and I. Petre, Conway\u2019s problem for three word sets, Theoret. Comput. Sci., to appear; preliminary version in LNCS 1853, 536\u2013546."},{"key":"3_CR12","unstructured":"M. Minsky, Computation: Finite and Infinite Machines, Prentice Hall, 1967."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0019-9958(72)90406-8","volume":"20","author":"D. Perrin","year":"1972","unstructured":"D. Perrin, Codes conjugu\u00e9s, Inform. and Control 20, 221\u2013231, 1972.","journal-title":"Inform. and Control"},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1051\/ita\/1989230404251","volume":"23","author":"B. Ratoandramanana","year":"1989","unstructured":"B. Ratoandramanana, Codes et motifs, RAIRO Theoret. Inform. 23, 425\u2013444, 1989.","journal-title":"RAIRO Theoret. Inform."},{"key":"3_CR15","unstructured":"Ch. Reutenauer, Centralizers of Noncommutative Series and Polynomials, In: M. Lothaire, Algebraic Combinatorics on Words, Chapter 9, Cambridge University Press, to appear."},{"key":"3_CR16","first-page":"579","volume":"21","author":"K. Ruohonen","year":"1985","unstructured":"K. Ruohonen, Reversible machines and Post\u2019s correspondence problem for biprefix morphisms, J. Inform. Process. Cybernet. EIK 21, 579\u2013595, 1985.","journal-title":"J. Inform. Process. Cybernet. EIK"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T06:52:43Z","timestamp":1550731963000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}