{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:54Z","timestamp":1759637874066},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_47","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:06:19Z","timestamp":1267553179000},"page":"569-580","source":"Crossref","is-referenced-by-count":15,"title":["The Power of Commuting with Finite Sets of Words"],"prefix":"10.1007","author":[{"given":"Michal","family":"Kunc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-45653-8_15","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"F. Baader","year":"2001","unstructured":"Baader, F., K\u00fcsters, R.: Unification in a description logic with transitive closure of roles. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 217\u2013232. Springer, Heidelberg (2001)"},{"key":"47_CR2","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1090\/S0002-9947-1969-0236208-5","volume":"137","author":"G.M. Bergman","year":"1969","unstructured":"Bergman, G.M.: Centralizers in free associative algebras. Trans. Amer. Math. Soc.\u00a0137, 327\u2013344 (1969)","journal-title":"Trans. Amer. Math. Soc."},{"key":"47_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, 69\u201379 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1017\/S0305004100036720","volume":"58","author":"P.M. Cohn","year":"1962","unstructured":"Cohn, P.M.: Factorization in non-commutative power series rings. Proc.\u00a0Cambridge Philos.\u00a0Soc.\u00a058, 452\u2013464 (1962)","journal-title":"Proc.\u00a0Cambridge Philos.\u00a0Soc."},{"key":"47_CR5","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, Boca Raton (1971)"},{"key":"47_CR6","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, 705\u2013725 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"47_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-45711-9_5","volume-title":"Formal and Natural Computing","author":"J. Karhum\u00e4ki","year":"2002","unstructured":"Karhum\u00e4ki, J., Petre, I.: The branching point approach to Conway\u2019s problem. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol.\u00a02300, pp. 69\u201376. Springer, Heidelberg (2002)"},{"key":"47_CR8","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1142\/9789812562494_0060","volume-title":"Current Trends in Theoretical Computer Science, The Challenge of the New Century","author":"J. Karhum\u00e4ki","year":"2004","unstructured":"Karhum\u00e4ki, J., Petre, I.: Two problems on commutation of languages. In: Current Trends in Theoretical Computer Science, The Challenge of the New Century, vol.\u00a02, pp. 477\u2013494. World Scientific, Singapore (2004)"},{"key":"#cr-split#-47_CR9.1","doi-asserted-by":"crossref","unstructured":"Kunc, M.: Regular solutions of language inequalities and well quasi-orders. Theoret. Comput. Sci. (2004)","DOI":"10.1007\/978-3-540-27836-8_73"},{"key":"#cr-split#-47_CR9.2","unstructured":"D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.): ICALP 2004. LNCS, vol.\u00a03142, pp. 870-881. Springer, Heidelberg (2004)"},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"Kunc, M.: The power of commuting with finite sets of words (2004) (manuscript), Available at \n                    \n                      http:\/\/www.math.muni.cz\/~kunc\/","DOI":"10.1007\/978-3-540-31856-9_47"},{"key":"47_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-2156-2","volume-title":"Language Equations","author":"E.L. Leiss","year":"1999","unstructured":"Leiss, E.L.: Language Equations. Springer, Heidelberg (1999)"},{"key":"47_CR12","volume-title":"Computation: Finite and Infinite Machines","author":"M.L. Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"47_CR13","doi-asserted-by":"crossref","unstructured":"Okhotin, A.: Decision problems for language equations (2003) (submitted for publication), Available at \n                    \n                      http:\/\/www.cs.queensu.ca\/home\/okhotin\/","DOI":"10.1007\/3-540-45061-0_21"},{"key":"47_CR14","unstructured":"Okhotin, A.: Greatest solutions of language equations (2003) (submitted for publication), Available at \n                    \n                      http:\/\/www.cs.queensu.ca\/home\/okhotin\/"},{"key":"47_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-31834-7_24","volume-title":"Machines, Computations, and Universality","author":"A. Okhotin","year":"2005","unstructured":"Okhotin, A.: On computational universality in language equations. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol.\u00a03354, pp. 292\u2013303. Springer, Heidelberg (2005)"},{"key":"47_CR16","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.\u00a0Th\u00e9or.\u00a0Appl.\u00a023, 425\u2013444 (1989)","journal-title":"RAIRO Inform.\u00a0Th\u00e9or.\u00a0Appl."},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"47_CR17","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:30:21Z","timestamp":1558287021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}