{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:11:14Z","timestamp":1725459074533},"publisher-location":"Berlin\/Heidelberg","reference-count":26,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540156895"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0028819","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T12:15:07Z","timestamp":1138191307000},"page":"351-360","source":"Crossref","is-referenced-by-count":0,"title":["Recent results on codes"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Reutenauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"J. Berstel, D. Perrin, The Theory of Codes, Acad. Press, to appear."},{"key":"35_CR2","unstructured":"J.M. Bo\u00eb, Un probl\u00e8me combinatoire de la th\u00e9orie des codes, Actes du colloque \"Algorithmique et Complexit\u00e9\", Avignon (1983), B. Rozoy ed."},{"key":"35_CR3","unstructured":"J. Betr\u00e9ma, Classification et repr\u00e9sentation de syst\u00e8mes d'action, Th\u00e8se 3\u00e8me cycle, Univ. Paris 7 (1981)."},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Y. C\u00e9sari, Sur l'application du th\u00e9or\u00e8me de Suschkewitsch \u00e0 l'\u00e9tude des codes rationnels complets, in J. Loeckx (ed.), Automata, Language and Programming, Springer Verlag (1974) 342\u2013350.","DOI":"10.1007\/3-540-06841-4_73"},{"key":"35_CR5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01706090","volume":"6","author":"Y. C\u00e9sari","year":"1972","unstructured":"Y. C\u00e9sari, Un algorithme donnant les codes bipr\u00e9fixes finis, Math. System Theory 6 (1972) 221\u2013225.","journal-title":"Math. System Theory"},{"key":"35_CR6","unstructured":"P.M. Cohn, Free rings and their relations,Acad. Press (1971)."},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"C. De Felice, Construction de codes factorisants, Theor. Comput. Sci. To appear.","DOI":"10.1016\/0304-3975(85)90033-7"},{"key":"35_CR8","unstructured":"C. De Felice, Extension de l'algorithme de construction des codes biprefixes aux chemins dans les graphes, in preparation."},{"key":"35_CR9","unstructured":"C. De Felice, A. Restivo, Some results on finite maximal codes, RAIRO Informatique th\u00e9orique, to appear."},{"key":"35_CR10","unstructured":"A. Ehrenfeucht, G. Rozenberg, RAIRO Informatique th\u00e9orique, to appear."},{"key":"35_CR11","unstructured":"S. Eilenberg, Automata, languages and machines, vol. A, Acad. Press (1974)."},{"key":"35_CR12","unstructured":"W. Feller, An introduction to probability theory and its applications, John Wiley (1957)"},{"key":"35_CR13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1090\/S0002-9947-1984-0748832-X","volume":"285","author":"G. Hansel","year":"1984","unstructured":"G. Hansel, D. Perrin, C. Reutenauer, Factorizing the polynomial of a code, Trans. Amer. Math. Soc. 285 (1984) 91\u2013105.","journal-title":"Trans. Amer. Math. Soc."},{"key":"35_CR14","unstructured":"G. Lallement, Semigroups and combinatorial applications, John Wiley (1979)."},{"key":"35_CR15","unstructured":"M. L\u00e9onard, Th\u00e8se 3\u00e8me cycle, Univ. Rouen (1985)."},{"key":"35_CR16","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, Bull. Soc. Math. France, 105 (1977) 385\u2013404.","journal-title":"Bull. Soc. Math France, Bull. Soc. Math. France"},{"key":"35_CR17","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF01214481","volume":"153","author":"D. Perrin","year":"1977","unstructured":"D. Perrin, Sur la transitivit\u00e9 du groupe d'un code bipr\u00e9fixe fini, Math. Z. 153 (1977) 283\u2013287.","journal-title":"Math. Z."},{"key":"35_CR18","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF02676657","volume":"23","author":"C. Reutenauer","year":"1981","unstructured":"C. Reutenauer, Semisimplicity of the algebra associated to a biprefix code, Semigroup Forum 23 (1981) 327\u2013342.","journal-title":"Semigroup Forum"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"C. Reutenauer, Noncommutative factorization of variable-length codes, J. Pure Applied Algebra, to appear.","DOI":"10.1016\/0022-4049(85)90069-6"},{"key":"35_CR20","unstructured":"C. Reutenauer, Ensembles libres de chemins dans un graphe, submitted."},{"key":"35_CR21","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/TIT.1956.1056809","volume":"2","author":"M.P. Sch\u00fctzenberger","year":"1956","unstructured":"M.P. Sch\u00fctzenberger, On an application of semigroup methods to some problem in coding, IRE Trans. Information Theory 2 (1956) 47\u201360.","journal-title":"IRE Trans. Information Theory"},{"key":"35_CR22","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":"35_CR23","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"C.E. Shannon, A mathematical theory of communication, Bell System Tech. J. 27 (1948) 379\u2013423, 623\u2013656.","journal-title":"Bell System Tech. J."},{"key":"35_CR24","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0097-3165(85)90032-9","volume":"38","author":"P. Shor","year":"1985","unstructured":"P. Shor, A counterexample to the triangle conjecture, J. Combin. Theory A 38 (1985) 110\u2013112.","journal-title":"J. Combin. Theory A"},{"key":"35_CR25","unstructured":"M. Vincent, Construction de codes ind\u00e9composables, RAIRO Informatique Th\u00e9orique to apper."},{"key":"35_CR26","unstructured":"P. Weil, Th\u00e8se 3\u00e8me cycle, Univ. Paris 7 (1985)."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028819.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:59:08Z","timestamp":1607533148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028819"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540156895"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0028819","relation":{},"subject":[]}}