{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:10Z","timestamp":1725483730759},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_25","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:28:20Z","timestamp":1178371700000},"page":"295-303","source":"Crossref","is-referenced-by-count":3,"title":["Factorizing Codes and Sch\u00fctzenberger Conjectures"],"prefix":"10.1007","author":[{"given":"Clelia","family":"De Felice","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"25_CR1","first-page":"103","volume":"99-5","author":"M. Anselmo","year":"1999","unstructured":"M. Anselmo, A Non-Ambiguous Languages Factorization Problem, in: Preproc. DLT\u201999 Aachener Informatik-Berichte 99-5 (1999) 103\u2013115.","journal-title":"Preproc. DLT\u201999 Aachener Informatik-Berichte"},{"key":"25_CR2","volume-title":"Theory of Codes","author":"J. Berstel","year":"1985","unstructured":"J. Berstel, D. Perrin, Theory of Codes, Academic Press, New York(1985)."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"J. Berstel, C. Reutenauer, Rational series and their languages, EATCS Monogr. Theoret. Comput. Sci. 12, Springer Verlag (1988).","DOI":"10.1007\/978-3-642-73235-5"},{"key":"25_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/3-540-08860-1_9","volume-title":"Une famille remarquable de codes ind\u00e9composables","author":"J. M. Bo\u00eb","year":"1978","unstructured":"J. M. Bo\u00eb, Une famille remarquable de codes ind\u00e9composables, Lecture Notes in Computer Science 62 (1978) 105\u2013112."},{"key":"25_CR5","unstructured":"J. M. Bo\u00eb, Sur les codes factorisants, in: \u201cTh\u00e9orie des codes\u201d (D. Perrin ed.), LITP (1979) 1\u20138."},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1142\/S0218196792000232","volume":"4","author":"V. Bruy\u00e9re","year":"1992","unstructured":"V. Bruy\u00e9re, C. De Felice, Synchronization and decomposability for a family of codes, Intern. Journ. of Algebra and Comput. 4 (1992) 367\u2013393.","journal-title":"Intern. Journ. of Algebra and Comput"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(94)E0138-8","volume":"140","author":"V. Bruy\u00e9re","year":"1995","unstructured":"V. Bruy\u00e9re, C. De Felice, Synchronization and decomposability for a family of codes: Part 2 Discrete Math. 140 (1995) 47\u201377.","journal-title":"Discrete Math."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF01706090","volume":"6","author":"Y. C\u00e9sari","year":"1972","unstructured":"Y. C\u00e9sari, Sur un algorithme donnant les codes bipr\u00e9fixes finis, Math. Syst. Theory 6 (1972) 221\u2013225.","journal-title":"Math. Syst. Theory"},{"key":"25_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/978-3-662-21545-6_26","volume-title":"Sur l\u2019application du th\u00e9or\u00e9me de Suschkevitch \u00e1 l\u2019\u00e9tude des codes rationnels complets","author":"Y. C\u00e9sari","year":"1974","unstructured":"Y. C\u00e9sari, Fr Sur l\u2019application du th\u00e9or\u00e9me de Suschkevitch \u00e1 l\u2019\u00e9tude des codes rationnels complets, Lecture Notes in Computer Science (1974) 342\u2013350."},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(85)90033-7","volume":"36","author":"C. Felice De","year":"1985","unstructured":"C. De Felice, Construction de codes factorisants, Theoret. Comput. Sci. 36 (1985) 99\u2013108.","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0304-3975(89)90076-5","volume":"63","author":"C. Felice De","year":"1989","unstructured":"C. De Felice, Construction of a family of finite maximal codes, Theoret. Comput. Sci. 63 (1989) 157\u2013184.","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR12","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"},{"key":"25_CR13","first-page":"111","volume":"4","author":"C. Felice De","year":"1999","unstructured":"C. De Felice, Haj\u00f3s factorizations of cyclic groups-a simpler proof of a characterization, Journal of Automata, Languages and Combinatorics, 4 (1999) 111\u2013116.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"25_CR14","unstructured":"C. De Felice, On some Sch\u00fctzenberger conjectures, submitted to Inf. and Comp. (1999), 29 pages."},{"key":"25_CR15","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, Comptes Rendus Acad. Sc. Paris 302 (1986) 169\u2013170.","journal-title":"Comptes Rendus Acad. Sc. Paris"},{"key":"25_CR16","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."},{"key":"25_CR17","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. Sc. Paris 240 (1937) 397\u2013399.","journal-title":"C. R. Acad. Sc. Paris"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0304-3975(97)00032-7","volume":"182","author":"N. H. Lam","year":"1997","unstructured":"N. H. Lam, Haj\u00f3s factorizations and completion of codes, Theoret. Comput. Sc. 182 (1997) 245\u2013256.","journal-title":"Theoret. Comput. Sc."},{"key":"25_CR19","doi-asserted-by":"crossref","first-page":"385","DOI":"10.24033\/bsmf.1857","volume":"105","author":"D. Perrin","year":"1977","unstructured":"D. Perrin, Codes asynchrones, Bull. Soc. math. France 105(1977) 385\u2013404.","journal-title":"Bull. Soc. math. France"},{"key":"25_CR20","first-page":"249","volume":"276","author":"D. Perrin","year":"1977","unstructured":"D. Perrin, M. P. Sch\u00fctzenberger, Un probl\u00e9me \u00e9l\u00e9mentaire de la th\u00e9orie de l\u2019information, in: \u201cTh\u00e9orie de l\u2019Information\u201d, Colloques Internat. CNRS 276, Cachan (1977) 249\u2013260.","journal-title":"Th\u00e9orie de l\u2019Information\u201d, Colloques Internat. CNRS"},{"key":"25_CR21","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":"25_CR22","doi-asserted-by":"publisher","first-page":"167","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 and Applied Algebra 36 (1985) 167\u2013186.","journal-title":"J. Pure and Applied Algebra"},{"key":"25_CR23","unstructured":"M. P. Sch\u00fctzenberger, Une th\u00e9orie alg\u00e9brique du codage, in: S\u00e9minaire Dubreil-Pisot 1955-56, expos\u00e9 no 15(1955) 24 pages."},{"key":"25_CR24","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1051\/ita\/1985190201651","volume":"19","author":"M. Vincent","year":"1985","unstructured":"M. Vincent, Construction de codes ind\u00e9composables, RAIRO Inform. Th\u00e9or. 19 (1985) 165\u2013178.","journal-title":"RAIRO Inform. Th\u00e9or"},{"key":"25_CR25","unstructured":"L. Zhang, C. K. Gu, Two classes of factorizing codes-(p; p)-codes and (4; 4)-codes, in: \u201cWords, Languages and Combinatorics II\u201d (M. Ito, H. J\u00fcrgensen, eds.), World Scientific (1994) 477\u2013483."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T18:41:17Z","timestamp":1556390477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}