{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:49:39Z","timestamp":1725472179811},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540488156"},{"type":"electronic","value":"9783540488163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11921240_15","type":"book-chapter","created":{"date-parts":[[2006,11,2]],"date-time":"2006-11-02T08:28:19Z","timestamp":1162456099000},"page":"213-227","source":"Crossref","is-referenced-by-count":0,"title":["Prime Decomposition Problem for Several Kinds of Regular Codes"],"prefix":"10.1007","author":[{"given":"Kieu","family":"Van Hung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Do Long","family":"Van","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","volume-title":"Theory of Codes","author":"J. Berstel","year":"1985","unstructured":"Berstel, J., Perrin, D.: Theory of Codes. Academic Press, New York (1985)"},{"key":"15_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 decomposition of regular prefix codes. Int. J. Found. Comput. Sci.\u00a014, 1019\u20131032 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1142\/S0129054106003887","volume":"17","author":"Y.-S. Han","year":"2006","unstructured":"Han, Y.-S., Wang, Y., Wood, D.: Infix-free regular expressions and languages. Int. J. Found. Comput. Sci.\u00a017, 379\u2013394 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11560647_6","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2005","author":"Y.-S. Han","year":"2005","unstructured":"Han, Y.-S., Wood, D.: Outfix-free regular languages and prime outfix-free decomposition. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol.\u00a03722, pp. 96\u2013109. Springer, Heidelberg (2005)"},{"key":"15_CR5","first-page":"17","volume":"31","author":"K.V. Hung","year":"2006","unstructured":"Hung, K.V.: On maximality for some kinds of codes over two-letter alphabets. Acta Math. Vietnam.\u00a031, 17\u201330 (2006)","journal-title":"Acta Math. Vietnam."},{"key":"15_CR6","first-page":"163","volume":"29","author":"K.V. Hung","year":"2004","unstructured":"Hung, K.V., Huy, P.T., Long Van, D.: On some classes of codes defined by binary relations. Acta Math. Vietnam.\u00a029, 163\u2013176 (2004)","journal-title":"Acta Math. Vietnam."},{"key":"15_CR7","first-page":"345","volume":"32","author":"K.V. Hung","year":"2004","unstructured":"Hung, K.V., Huy, P.T., Long Van, D.: Codes concerning roots of words. Vietnam J. Math.\u00a032, 345\u2013359 (2004)","journal-title":"Vietnam J. Math."},{"key":"15_CR8","first-page":"119","volume":"33","author":"K.V. Hung","year":"2005","unstructured":"Hung, K.V., Khang, N.Q.: An embedding algorithm for supercodes and sucypercodes. Vietnam J. Math.\u00a033, 119\u2013206 (2005)","journal-title":"Vietnam J. Math."},{"key":"15_CR9","volume-title":"Formal Languages and Their Relation to Automata","author":"J. Hopcroft","year":"1969","unstructured":"Hopcroft, J., Ullman, J.: Formal Languages and Their Relation to Automata. Addison-Wesley Publishing Company, MA (1969)"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/0022-0000(91)90026-2","volume":"43","author":"M. Ito","year":"1991","unstructured":"Ito, M., J\u00fcrgensen, H., Shyr, H., Thierrin, G.: Outfix and infix codes and related classes of languages. J. Comput., Syst. Sci.\u00a043, 484\u2013508 (1991)","journal-title":"J. Comput., Syst. Sci."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/0304-3975(94)00018-E","volume":"136","author":"M. Ito","year":"1994","unstructured":"Ito, M., Thierrin, G.: Congruences, infix and cohesive prefix codes. Theoret. Comput. Sci.\u00a0136, 471\u2013485 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/978-3-642-59136-5_8","volume-title":"Handbook of Formal Languages","author":"H. J\u00fcrgensen","year":"1997","unstructured":"J\u00fcrgensen, H., Konstantinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 511\u2013607. Springer, Heidelberg (1997)"},{"key":"15_CR13","unstructured":"Mateescu, A., Salomaa, A., Yu, S.: On the decomposition of finite languages, Technical Report 222, TUCS (1998)"},{"key":"15_CR14","first-page":"339","volume":"15","author":"A. Mateescu","year":"2002","unstructured":"Mateescu, A., Salomaa, A., Yu, S.: Factorizations of languages and commutativity conditions. Acta Cyber\u00a015, 339\u2013351 (2002)","journal-title":"Acta Cyber"},{"key":"15_CR15","volume-title":"Free Monoids and Languages","author":"H. Shyr","year":"1991","unstructured":"Shyr, H.: Free Monoids and Languages. Hon Min Book Company, Taichung (1991)"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1142\/9789812704979_0012","volume-title":"Words, Languages and Combinatorics III","author":"D. Van Long","year":"2003","unstructured":"Long Van, D.: On a class of hypercodes. In: Ito, M., Imaoka, T. (eds.) Words, Languages and Combinatorics III, pp. 171\u2013183. World Scientific, Singapore (2003)"},{"key":"15_CR17","unstructured":"Long Van, D., Hung, K.V.: An approach to the embedding problem for codes defined by binary relations. In: Proceedings of CAI, Greece, pp. 111\u2013127 (2005)"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1142\/9789812773036_0027","volume-title":"Formal Models, Languages and Applications","author":"D. Van Long","year":"2006","unstructured":"Long Van, D., Hung, K.V.: Characterizations of some classes of codes defined by binary relations. In: Subramanian, K.G., Rangarajan, K., Mukund, M. (eds.) Formal Models, Languages and Applications, vol.\u00a066, pp. 391\u2013410. World Scientific, Singapore (2006)"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/11560647_2","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2005","author":"D. Van Long","year":"2005","unstructured":"Long Van, D., Van Hung, K., Huy, P.T.: Codes and length-increasing transitive binary relations. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol.\u00a03722, pp. 29\u201348. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11921240_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T11:53:04Z","timestamp":1552305184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11921240_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540488156","9783540488163"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11921240_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}