{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:22:12Z","timestamp":1725895332439},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540882817"},{"type":"electronic","value":"9783540882824"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-88282-4_43","type":"book-chapter","created":{"date-parts":[[2008,9,24]],"date-time":"2008-09-24T03:46:38Z","timestamp":1222227998000},"page":"476-486","source":"Crossref","is-referenced-by-count":3,"title":["Length Codes, Products of Languages and Primality"],"prefix":"10.1007","author":[{"given":"Arto","family":"Salomaa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1142\/S0218196705002116","volume":"15","author":"S.V. Avgustinovich","year":"2005","unstructured":"Avgustinovich, S.V., Frid, A.: A unique decomposition theorem for factorial languages. Internat. J. Alg. Comp.\u00a015, 149\u2013160 (2005)","journal-title":"Internat. J. Alg. Comp."},{"key":"43_CR2","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1142\/S0129054103002151","volume":"14","author":"J. Czyzowicz","year":"2003","unstructured":"Czyzowicz, J., Fraczak, W., Pelc, A., Rytter, W.: Linear-time prime decompositions of regular prefix codes. Internat. J. Found. Comp. Sci.\u00a014, 1019\u20131031 (2003)","journal-title":"Internat. J. Found. Comp. Sci."},{"key":"43_CR3","unstructured":"Daley, M., Domaratzki, M., Salomaa, K.: On the operational orthogonality of languages. In: Proc. Workshop on Language Equations, vol.\u00a044, pp. 43\u201353. TUCS General Publications (2007)"},{"key":"43_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-73208-2_20","volume-title":"Developments in Language Theory","author":"A. Frid","year":"2007","unstructured":"Frid, A.: Commutation in binary factorial languages. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 193\u2013204. Springer, Heidelberg (2007)"},{"key":"43_CR5","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2007.01.013","volume":"376","author":"Y.-S. Han","year":"2007","unstructured":"Han, Y.-S., Salomaa, A., Salomaa, K., Wood, D., Yu, S.: Prime decompositions of regular languages. Theor. Comp. Sci.\u00a0376, 60\u201369 (2007)","journal-title":"Theor. Comp. Sci."},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Han, Y.-S., Wang, Y., Wood, D.: Infix-free regular expressions and languages. Internat. J. Found. Comp. Sci. (to appear)","DOI":"10.1142\/S0129054106003887"},{"key":"43_CR7","series-title":"Lecture Notes in Computer Science","first-page":"156","volume-title":"Implementation and Application of Automata","author":"Y.-S. Han","year":"2005","unstructured":"Han, Y.-S., Wood, D.: The generalization of generalized automata: Expression automata. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 156\u2013166. Springer, Heidelberg (2005)"},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00224-006-1321-z","volume":"40","author":"M. Kunc","year":"2007","unstructured":"Kunc, M.: The power of commuting with finite sets of words. Theory Comput. Syst.\u00a040, 521\u2013551 (2007)","journal-title":"Theory Comput. Syst."},{"key":"43_CR9","first-page":"339","volume":"15","author":"A. Mateescu","year":"2002","unstructured":"Mateescu, A., Salomaa, A., Yu, S.: Factorizations of languages and commutativity conditions. Acta Cybernetica\u00a015, 339\u2013351 (2002)","journal-title":"Acta Cybernetica"},{"key":"43_CR10","first-page":"1","volume-title":"Handbook of Formal Languages 1\u20133","year":"1997","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, pp. 1\u20133. Springer, Berlin (1997)"},{"key":"43_CR11","first-page":"22","volume-title":"Developments in Language Theory, DLT 1999","author":"A. Salomaa","year":"2000","unstructured":"Salomaa, A., Yu, S.: On the decomposition of finite languages. In: Developments in Language Theory, DLT 1999, pp. 22\u201331. World Scientific Publ. Co., Singapore (2000)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88282-4_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T08:00:17Z","timestamp":1619510417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88282-4_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540882817","9783540882824"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88282-4_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}