{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:26Z","timestamp":1725664586192},"publisher-location":"Berlin, Heidelberg","reference-count":54,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614401"},{"type":"electronic","value":"9783540685807"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61440-0_115","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:37:58Z","timestamp":1330274278000},"page":"24-47","source":"Crossref","is-referenced-by-count":13,"title":["Variable-length maximal codes"],"prefix":"10.1007","author":[{"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"first","affiliation":[]},{"given":"Michel","family":"Latteux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1137\/0406046","volume":"6","author":"J. Ashley","year":"1993","unstructured":"J. Ashley, B. Marcus, D. Perrin, S. Tuncel, Surjective extensions of sliding block codes, SIAM J. Discrete Math. 6 (1993) 582\u2013611.","journal-title":"SIAM J. Discrete Math."},{"unstructured":"J. Berstel, D. Perrin, Theory of Codes, Academic Press (1985).","key":"3_CR2"},{"key":"3_CR3","first-page":"84","volume":"29","author":"J. Berstel","year":"1986","unstructured":"J. Berstel, D. Perrin, Trends in the theory of codes, Bull. EATCS 29 (1986) 84\u201395.","journal-title":"Bull. EATCS"},{"doi-asserted-by":"crossref","unstructured":"J. Berstel, C. Reutenauer, Rational series and their languages, EATCS Monogr. Theoret. Comput. Sci. 12, Springer-Verlag (1988).","key":"3_CR4","DOI":"10.1007\/978-3-642-73235-5"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/3-540-08860-1_9","volume":"62","author":"J.-M. Bo\u00eb","year":"1978","unstructured":"J.-M. Bo\u00eb, Une famille remarquable de codes ind\u00e9composables, Lecture Notes in Comput. Sci. 62 (1978) 105\u2013112.","journal-title":"Lecture Notes in Comput. Sci."},{"unstructured":"J.-M. Bo\u00eb, Sur les codes synchronisants coupants, in: Non-commutative Structures in Algebra and Geometric Combinatorics, A. De Luca, Ed., Quaderni de la Ricerca Scientifica 109 (1981) 7\u201310.","key":"3_CR6"},{"unstructured":"J.-M. Bo\u00eb, Factorisation par exc\u00e8s du mono\u00efde libre, Technical Report 94-005, University of Montpellier (1994) 6 pages.","key":"3_CR7"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0023821","volume":"583","author":"V. Bruy\u00e8re","year":"1992","unstructured":"V. Bruy\u00e8re, Automata and codes with bounded deciphering delay, Lecture Notes in Comput. Sci. 583 (1992) 99\u2013107.","journal-title":"Lecture Notes in Comput. Sci."},{"unstructured":"V. Bruy\u00e8re, D. Derencourt, M. Latteux, The meet operation in the lattice of codes submitted (1996) 16 pages.","key":"3_CR9"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/S0195-6698(13)80036-4","volume":"11","author":"V. Bruy\u00e8re","year":"1990","unstructured":"V. Bruy\u00e8re, L. Wang, L. Zhang, On completion of codes with finite deciphering delay, European J. Combin. 11 (1990) 513\u2013521.","journal-title":"European J. Combin."},{"doi-asserted-by":"crossref","unstructured":"J. Brzozowski, Open problems about regular languages, in: Formal Language Theory: Perspectives and Open Problems, R.V. Book, Ed., Academic Press (1980) 23\u201345.","key":"3_CR11","DOI":"10.1016\/B978-0-12-115350-2.50007-5"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0304-3975(88)90114-4","volume":"60","author":"A. Carpi","year":"1988","unstructured":"A. Carpi, On synchronizing unambiguous automata, Theoret. Comput. Sci. 60 (1988) 285\u2013296.","journal-title":"Theoret. Comput. Sci."},{"unstructured":"Y. C\u00e9sari, Sur l'application du th\u00e9or\u00e8me de Suschkevitch \u00e0 l'\u00e9tude des codes rationnels complets, in: Automata, Languages and Programming, Lecture Notes in Comput. Sci. (1974) 342\u2013350.","key":"3_CR13"},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/S1385-7258(53)50034-4","volume":"15","author":"N. G. Bruijn de","year":"1953","unstructured":"N. G. de Bruijn, On the factorization of cyclic groups, Indag. Math. 15 (1953) 258\u2013264.","journal-title":"Indag. Math."},{"doi-asserted-by":"crossref","unstructured":"D. Derencourt, A three-word code which is not prefix-suffix composed, to appear in Theoret. Comput. Sci (1996) 15 pages.","key":"3_CR15","DOI":"10.1016\/0304-3975(95)00139-5"},{"unstructured":"D. Derencourt, personal communication (1996).","key":"3_CR16"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0012-365X(93)90291-Z","volume":"122","author":"C. Felice De","year":"1993","unstructured":"C. De Felice, A partial result about the factorization conjecture for finite variable-length codes, Discrete Math. 122 (1993) 137\u2013152.","journal-title":"Discrete Math."},{"unstructured":"C. De Felice, An application of Haj\u00f3s factorizations to variable-length codes, to appear in Theoret. Comput. Sci. (1996) 31 pages.","key":"3_CR18"},{"key":"3_CR19","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1051\/ita\/1985190403831","volume":"19","author":"C. Felice De","year":"1985","unstructured":"C. De Felice, A. Restivo, Some results on finite maximal codes, RAIRO Inform. Th\u00e9or. Appl. 19 (1985) 383\u2013403.","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"3_CR20","first-page":"169","volume":"302","author":"C. Felice De","year":"1986","unstructured":"C. De Felice, C. Reutenauer, Solution partielle de la conjecture de factorisation des codes C. R. Acad. Sci. Paris 302 (1986) 169\u2013170.","journal-title":"C. R. Acad. Sci. Paris"},{"key":"3_CR21","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1051\/ita\/1986200100891","volume":"20","author":"A. Ehrenfeucht","year":"1985","unstructured":"A. Ehrenfeucht, G. Rozenberg, Each regular code is included in a regular maximal code, RAIRO Inform. Th\u00e9or. Appl. 20 (1985) 89\u201396.","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"unstructured":"S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press (1974).","key":"3_CR22"},{"unstructured":"L. Fuchs, Abelian Groups, Pergamon Press (1960).","key":"3_CR23"},{"key":"3_CR24","first-page":"157","volume":"74","author":"G. Haj\u00f3s","year":"1950","unstructured":"G. Haj\u00f3s, Sur la factorisation des groupes ab\u00e9liens, Casopis Pest. Mat. Fys. 74 (1950) 157\u2013162.","journal-title":"Casopis Pest. Mat. Fys."},{"unstructured":"R.W. Hamming, Coding and Information Theory, Prentice-Hall (1986).","key":"3_CR25"},{"unstructured":"J. Hopcroft, J. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley (1979).","key":"3_CR26"},{"unstructured":"H. J\u00fcrgensen, S. Konstantinidis, Codes, in: Handbook of Formal Languages, G. Rozenberg, A. Salomaa, Eds, Springer-Verlag, to appear (1996).","key":"3_CR27"},{"unstructured":"R. K\u00f6nig, Lectures on codes, Technical Report 93-3, University of Erlangen (1993) 66 pages.","key":"3_CR28"},{"key":"3_CR29","first-page":"397","volume":"240","author":"M. Krasner","year":"1937","unstructured":"M. Krasner, B. Ranulac, Sur une propri\u00e9t\u00e9 des polyn\u00f4mes de la division du cercle, C. R. Acad. Sci. Paris 240 (1937) 397\u2013399.","journal-title":"C. R. Acad. Sci. Paris"},{"key":"3_CR30","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1007\/3-540-57785-8_182","volume":"775","author":"N. H. Lam","year":"1994","unstructured":"N. H. Lam, On codes having no finite completion, Lecture Notes in Comput. Sci. 775 (1994) 691\u2013698.","journal-title":"Lecture Notes in Comput. Sci."},{"unstructured":"N.H. Lam, A property of finite maximal codes, preprint (1996) 8 pages.","key":"3_CR31"},{"doi-asserted-by":"crossref","unstructured":"D. Lind, B. Marcus, Symbolic Dynamics and Coding, Cambridge University Press (1996).","key":"3_CR32","DOI":"10.1017\/CBO9780511626302"},{"key":"3_CR33","first-page":"87","volume":"1","author":"A. A. Markov","year":"1967","unstructured":"A. A. Markov, An example of an independent system of words which cannot be included in a finite complete system (in Russian), Mat. Zametki 1 (1967) 87\u201390.","journal-title":"Mat. Zametki"},{"unstructured":"R.J. McEliece, The Theory of Information and Coding, Enc. of Math. 3, Addison-Wesley (1977).","key":"3_CR34"},{"unstructured":"F.J. McWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland (1977).","key":"3_CR35"},{"key":"3_CR36","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/3-540-56503-5_34","volume":"665","author":"R. Montalbano","year":"1993","unstructured":"R. Montalbano, Local automata and completion, Lecture Notes in Comput. Sci. 665 (1993) 333\u2013342.","journal-title":"Lecture Notes in Comput. Sci."},{"key":"3_CR37","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(83)90028-2","volume":"28","author":"D. Perrin","year":"1984","unstructured":"D. Perrin, Completing biprefix codes, Theoret. Comput. Sci. 28 (1984) 329\u2013336.","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"D. Perrin, Finite automata, in: Handbook of Theoretical Computer Science, vol. B, J. Van Leeuwen, Ed., Elsevier (1990) 2\u201357.","key":"3_CR38","DOI":"10.1016\/B978-0-444-88074-1.50006-8"},{"key":"3_CR39","first-page":"249","volume":"276","author":"D. Perrin","year":"1977","unstructured":"D. Perrin, M.-P. Sch\u00fctzenberger, Un probl\u00e8me \u00e9l\u00e9mentaire de la th\u00e9orie de l'information, Th\u00e9orie de l'Information, Colloques Internat. CNRS 276, Cachan (1977) 249\u2013260.","journal-title":"Th\u00e9orie de l'Information, Colloques Internat. CNRS"},{"key":"3_CR40","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0012-365X(77)90164-9","volume":"17","author":"A. Restivo","year":"1977","unstructured":"A. Restivo, On codes having no finite completions, Discrete Math. 17 (1977) 309\u2013316.","journal-title":"Discrete Math."},{"key":"3_CR41","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1051\/ita\/1989230201351","volume":"23","author":"A. Restivo","year":"1989","unstructured":"A. Restivo, S. Salemi, T. Sportelli, Completing codes, RAIRO Inform. Th\u00e9or. Appl. 23 (1989) 135\u2013147.","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"3_CR42","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0022-4049(85)90069-6","volume":"36","author":"C. Reutenauer","year":"1985","unstructured":"C. Reutenauer, Non commutative factorization of variable length codes, J. Pure Appl. Algebra 36 (1985) 157\u2013186.","journal-title":"J. Pure Appl. Algebra"},{"key":"3_CR43","volume-title":"Jewels of Formal Language Theory","author":"A. Salomaa","year":"1981","unstructured":"A. Salomaa, Jewels of Formal Language Theory, Washington, D.C.: Computer Science Press (1981)."},{"key":"3_CR44","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1017\/S0017089500002202","volume":"15","author":"A. D. Sands","year":"1974","unstructured":"A. D. Sands, On a conjecture og G. Haj\u00f3s, Glasgow Math. J. 15 (1974) 88\u201389.","journal-title":"Glasgow Math. J."},{"unstructured":"M.-P. Sch\u00fctzenberger, Une th\u00e9orie alg\u00e9brique du codage, S\u00e9minaire Dubreil-Pisot 1955\u201356, expos\u00e9 no 15 (1955).","key":"3_CR45"},{"key":"3_CR46","doi-asserted-by":"crossref","first-page":"209","DOI":"10.24033\/bsmf.1623","volume":"93","author":"M.-P. Sch\u00fctzenberger","year":"1965","unstructured":"M.-P. Sch\u00fctzenberger, Sur certains sous-mono\u00efdes libres, Bull. Soc. Math. France 93 (1965) 209\u2013223.","journal-title":"Bull. Soc. Math. France"},{"key":"3_CR47","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0021-9800(66)80015-7","volume":"1","author":"M.-P. Sch\u00fctzenberger","year":"1966","unstructured":"M.-P. Sch\u00fctzenberger, On a question concerning certain free submonoids, J. Combin. Theory 1 (1966) 437\u2013442.","journal-title":"J. Combin. Theory"},{"key":"3_CR48","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/0097-3165(85)90032-9","volume":"38","author":"P. Shor","year":"1983","unstructured":"P. Shor, A counterexample to the triangle conjecture, J. Combin. Theor. Ser. A 38 (1983) 110\u2013112.","journal-title":"J. Combin. Theor. Ser. A"},{"unstructured":"H.J. Shyr, Free Monoids and Languages, Hon Min Book Company, Taichung, second ed. (1991).","key":"3_CR49"},{"unstructured":"S. Szabo, personal communication to A. Restivo (1992).","key":"3_CR50"},{"doi-asserted-by":"crossref","unstructured":"J.H. Van Lindt, Introduction to Coding Theory, Graduate Texts in Math. 86, Springer-Verlag (1982).","key":"3_CR51","DOI":"10.1007\/978-3-662-07998-0"},{"unstructured":"L. Zhang, Every finite maximal code is a factorizing code, manuscript (1993) 19 pages.","key":"3_CR52"},{"unstructured":"L. Zhang, C.K. Gu, Two classes of factorizing codes \u2014 (p,p) codes and (4, 4) codes, In: Words, languages and combinatorics II, M. Ito, H. J\u00fcrgensen, Eds., World Scientific (1994) 477\u2013483.","key":"3_CR53"},{"key":"3_CR54","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0304-3975(94)00300-8","volume":"145","author":"L. Zhang","year":"1995","unstructured":"L. Zhang, Z. Shen, Completion of recognizable bifix codes, Theoret. Comput. Sci. 145 (1995) 345\u2013355.","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61440-0_115.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:06:09Z","timestamp":1605629169000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61440-0_115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614401","9783540685807"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/3-540-61440-0_115","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}