{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:37Z","timestamp":1760202517646},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291077"},{"type":"electronic","value":"9783540320722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560647_2","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:04:06Z","timestamp":1129817046000},"page":"29-48","source":"Crossref","is-referenced-by-count":3,"title":["Codes and Length-Increasing Transitive Binary Relations"],"prefix":"10.1007","author":[{"given":"Do Long","family":"Van","sequence":"first","affiliation":[]},{"given":"Kieu","family":"Van Hung","sequence":"additional","affiliation":[]},{"given":"Phan Trung","family":"Huy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_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":"2_CR2","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(92)90006-2","volume":"98","author":"V. Bruy\u00e8re","year":"1992","unstructured":"Bruy\u00e8re, V., Latteux, M.: Variable-length maximal codes. Theoretical Computer Science\u00a098, 321\u2013337 (1992)","journal-title":"Theoretical Computer Science"},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/S0195-6698(13)80036-4","volume":"11","author":"V. Bruy\u00e8re","year":"1990","unstructured":"Bruy\u00e8re, V., Wang, L., Zhang, L.: On completion of codes with finite deciphering delay. European Journal of Combinatorics\u00a011, 513\u2013521 (1990)","journal-title":"European Journal of Combinatorics"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1051\/ita\/1986200100891","volume":"20","author":"A. Ehrenfeucht","year":"1986","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Each regular code is included in a maximal regular code. RAIRO Theoretical Informatics and Applications\u00a020, 89\u201396 (1986)","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"2_CR5","volume-title":"Universal Algebra","author":"G. Gr\u00e4tzer","year":"1968","unstructured":"Gr\u00e4tzer, G.: Universal Algebra. Van Nostrand, Princeton (1968)"},{"key":"2_CR6","first-page":"163","volume":"29","author":"K.V. Hung","year":"2004","unstructured":"Hung, K.V., Huy, P.T., Van, D.L.: On some classes of codes defined by binary relations. Acta Mathematica Vietnamica\u00a029, 163\u2013176 (2004)","journal-title":"Acta Mathematica Vietnamica"},{"key":"2_CR7","first-page":"345","volume":"32","author":"K.V. Hung","year":"2004","unstructured":"Hung, K.V., Huy, P.T., Van, D.L.: Codes concerning roots of words. Vietnam Journal of Mathematics\u00a032, 345\u2013359 (2004)","journal-title":"Vietnam Journal of Mathematics"},{"key":"2_CR8","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, Massachussetts (1969)"},{"key":"2_CR9","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. Journal of Computer and System Science\u00a043, 484\u2013508 (1991)","journal-title":"Journal of Computer and System Science"},{"key":"2_CR10","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. Theoretical Computer Science\u00a0136, 471\u2013485 (1994)","journal-title":"Theoretical Computer Science"},{"key":"2_CR11","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., Konstatinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 511\u2013607. Springer, Berlin (1997)"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/PL00006033","volume":"61","author":"N.H. Lam","year":"2000","unstructured":"Lam, N.H.: Finite maximal infix codes. Semigroup Forum\u00a061, 346\u2013356 (2000)","journal-title":"Semigroup Forum"},{"key":"2_CR13","first-page":"87","volume":"1","author":"A.A. Markov","year":"1967","unstructured":"Markov, A.A.: An example of an independent system of words which cannot be included in a finite complete system. Matematicheskie Zametki\u00a01, 87\u201390 (1967) (in Russian)","journal-title":"Matematicheskie Zametki"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(83)90028-2","volume":"28","author":"D. Perrin","year":"1984","unstructured":"Perrin, D.: Completing biprefix codes. Theoretical Computer Science\u00a028, 329\u2013336 (1984)","journal-title":"Theoretical Computer Science"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0012-365X(77)90164-9","volume":"17","author":"A. Restivo","year":"1977","unstructured":"Restivo, A.: On codes having no finite completion. Discrete Mathematics\u00a017, 309\u2013316 (1977)","journal-title":"Discrete Mathematics"},{"key":"2_CR16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1051\/ita\/1989230201351","volume":"23","author":"A. Restivo","year":"1989","unstructured":"Restivo, A., Salemi, S., Sportelli, T.: Completing codes. RAIRO Theoretical Informatics and Applications\u00a023, 135\u2013147 (1989)","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"2_CR17","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":"2_CR18","doi-asserted-by":"crossref","unstructured":"Shyr, H., Thierrin, G.: Codes and binary relations. In: Lecture Notes 586 \u201cS\u00e8minarie d\u2019Alg\u00e8bre, Paul Dubreil, Paris, pp. 180\u2013188. Springer, Heidelberg (1975-1976)","DOI":"10.1007\/BFb0087133"},{"key":"2_CR19","unstructured":"Van Embedding, D.L.: problem for codes defined by binary relations. Preprint 98\/A22, Institute of Mathematics, Hanoi (1998)"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1142\/9789812704979_0012","volume-title":"Words, Languages and Combinatorics III","author":"D.L. Van","year":"2003","unstructured":"Van, D.L.: On a class of hypercodes. In: Ito, M., Imaoka, T. (eds.) Words, Languages and Combinatorics III, pp. 171\u2013183. World Scientific, Singapore (2003)"},{"key":"2_CR21","unstructured":"Van, D.L., Hung, K.V.: On codes defined by binary relations, Part I: Embedding problem (submitted)"},{"key":"2_CR22","unstructured":"Van, D.L., Hung, K.V.: On codes defined by binary relations, Part II: Vector characterizations and maximality (submitted)"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0304-3975(94)00300-8","volume":"145","author":"L. Zhang","year":"1995","unstructured":"Zhang, L., Shen, Z.: Completion of recognizable bifix codes. Theoretical Computer Science\u00a0145, 345\u2013355 (1995)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560647_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T02:49:00Z","timestamp":1552445340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560647_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291077","9783540320722"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11560647_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}