{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:44Z","timestamp":1759637984598},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207818"},{"type":"electronic","value":"9783540246350"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24635-0_8","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T11:11:15Z","timestamp":1280747475000},"page":"119-131","source":"Crossref","is-referenced-by-count":1,"title":["Fixed Point Approach to Commutation of Languages"],"prefix":"10.1007","author":[{"suffix":"II","given":"Karel","family":"Culik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petri","family":"Salmela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","first-page":"178","volume":"79","author":"J. Berstel","year":"2003","unstructured":"Berstel, J., Karhum\u00e4ki, J.: Combinatorics on words \u2013 A tutorial. Bull EATCS\u00a079, 178\u2013229 (2003)","journal-title":"Bull EATCS"},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/978-3-642-59136-5_6","volume-title":"Handbook of Formal Languages","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.\u00a01, pp. 329\u2013438. Springer, Heidelberg (1997)"},{"issue":"1-2","key":"8_CR3","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.\u00a0273(1-2), 69\u201379 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1006\/jcss.2002.1836","volume":"65","author":"T. Harju","year":"2002","unstructured":"Harju, T., Ibarra, O., Karhum\u00e4ki, J., Salomaa, A.: Decision questions concerning semilinearity, morphisms and commutation of languages. J. Comput. System Sci.\u00a065, 278\u2013294 (2002)","journal-title":"J. Comput. System Sci."},{"key":"8_CR5","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-44669-9_3","volume-title":"Fundamentals of Computation Theory","author":"J. Karhum\u00e4ki","year":"2001","unstructured":"Karhum\u00e4ki, J.: Challenges of commutation: an advertisement. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol.\u00a02138, pp. 15\u201323. Springer, Heidelberg (2001)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-36494-3_8","volume-title":"STACS 2003","author":"J. Karhum\u00e4ki","year":"2003","unstructured":"Karhum\u00e4ki, J., Latteux, M., Petre, I.: The commutation with codes and ternary sets of words. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 74\u201384. Springer, Heidelberg (2003)"},{"issue":"1","key":"8_CR8","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.\u00a0289(1), 705\u2013725 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR9","unstructured":"Karhum\u00e4ki, J., Petre, I.: Two problems on commutation of languages. In: P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science, World Scientific, Singapore (to appear)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-44669-9_20","volume-title":"Fundamentals of Computation Theory","author":"J. Karhum\u00e4ki","year":"2001","unstructured":"Karhum\u00e4ki, J., Plandowski, W., Rytter, W.: On the complexity of decidable cases of the commutation problem of languages. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol.\u00a02138, pp. 193\u2013203. Springer, Heidelberg (2001)"},{"key":"8_CR11","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983)"},{"key":"8_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"key":"8_CR13","series-title":"Theoretical Computer Science. An EATCS series","volume-title":"DNA Computing. New Computing Paradigms","author":"G. P\u0103un","year":"1998","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Theoretical Computer Science. An EATCS series. Springer, Heidelberg (1998)"},{"key":"8_CR14","unstructured":"Petre, I.: Commutation Problems on Sets of Words and Formal Power Series, PhD Thesis, University of Turku (2002)"},{"issue":"4","key":"8_CR15","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.\u00a023(4), 425\u2013444 (1989)","journal-title":"RAIRO Inform. Theor."},{"key":"8_CR16","unstructured":"Salmela, P.: Rationaalisen kielen sentralisaattorista ja sen m\u00e4\u00e4ritt\u00e4misest\u00e4 kiintopistemetodilla, Master\u2019s theses. University of Turku (2002)"},{"key":"8_CR17","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, London (1973)"},{"key":"8_CR18","unstructured":"Grail+ 3.0 \u2013 software package, Department of Computer Science. University of Western Ontario, Canada, \n                  \n                    http:\/\/www.csd.uwo.ca\/research\/grail\/grail.html"}],"container-title":["Lecture Notes in Computer Science","Aspects of Molecular Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24635-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T16:57:01Z","timestamp":1580317021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24635-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540207818","9783540246350"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24635-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}