{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:04Z","timestamp":1725663184086},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540081388"},{"type":"electronic","value":"9783540373896"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1977]]},"DOI":"10.1007\/3-540-08138-0_3","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:18:27Z","timestamp":1330186707000},"page":"27-44","source":"Crossref","is-referenced-by-count":13,"title":["Informatique et algebre la theorie des codes a longueur variable"],"prefix":"10.1007","author":[{"given":"J. -F.","family":"Perrot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,23]]},"reference":[{"key":"3_CR1","volume-title":"Information theory","author":"R. Ash","year":"1965","unstructured":"ASH, R.: Information theory, Interscience \u2014 Wiley, 1965."},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1090\/S0002-9904-1965-11395-7","volume":"71","author":"E. K. Blum","year":"1965","unstructured":"BLUM, E.K.: A note on free subsemigroups with two generators, Bull. American Math. Soc. 71 (1965) 678\u2013679.","journal-title":"Bull. American Math. Soc."},{"key":"3_CR3","unstructured":"BOE, J-M.: Repr\u00e9sentations des mono\u00efdes: Applications \u00e0 la th\u00e9orie des codes, Th\u00e8se 3\u00e8me cycle, Montpellier 1976."},{"key":"3_CR4","unstructured":"BOE, J-M., J. BOYAT, Y. CESARI, A. LACHENY et M. VINCENT: Automates et mono\u00efdes syntaxiques des sous-mono\u00efdes libres, \u00e0 para\u00eetre dans Information and Control."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"CESARI, Y.: Sur l'application du th\u00e9or\u00e8me de Suschkewitsch \u00e0 l'\u00e9tude des codes rationnels complets, in Automata, Languages, and Programming, 2nd Colloquium, J. Loeckx, Ed., (Lecture Notes in Computer Science, no14), Springer 1974, p. 342\u2013350.","DOI":"10.1007\/3-540-06841-4_73"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"CLIFFORD, A.H. and G.B. PRESTON: The Algebraic Theory of Semigroups, American Math. Soc. Vol 1: 1961, Vol. 2: 1967.","DOI":"10.1090\/surv\/007.1\/01"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0019-9958(76)90250-3","volume":"32","author":"A. Luca De","year":"1976","unstructured":"DE LUCA, A.: A Note on Variable Length Codes, Information and Control 32 (1976) 263\u2013271.","journal-title":"Information and Control"},{"key":"3_CR8","unstructured":"EILENBERG, S.: Automata, Languages and Machines, Academic Press, Vol. A: 1974, Vol. B: 1976."},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","volume":"38","author":"E. N. Gilbert","year":"1959","unstructured":"GILBERT, E.N. and E.F. MOORE: Variable-Length Binary Encodings, Bell System Tech. J. 38 (1959) 933\u2013967.","journal-title":"Bell System Tech. J."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0019-9958(76)90511-8","volume":"30","author":"K. Hashiguchi","year":"1976","unstructured":"HASHIGUCHI, K. and N. HONDA: Homomorphisms that Preserve Star height, Information and Control 30 (1976) 247\u2013266.","journal-title":"Information and Control"},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/S0022-0000(76)80007-4","volume":"12","author":"K. Hashiguchi","year":"1976","unstructured":"HASHIGUCHI, K. and N. HONDA: Properties of Code Events and Homomorphisms over Regular Events, J. Comput. System Sci. 12 (1976) 352\u2013367.","journal-title":"J. Comput. System Sci."},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF02194775","volume":"8","author":"M. Keenan","year":"1974","unstructured":"KEENAN, M. and G. LALLEMENT: On certain Codes admitting inverse semigroups as Syntactic monoids, Semigroup Forum 8 (1974) 312\u2013331.","journal-title":"Semigroup Forum"},{"key":"3_CR13","unstructured":"LANDI, D.M.: Variable-length encodings, Ph. D. Thesis, North-western University, 1966."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"LENTIN, A.: Equations dans les mono\u00efdes libres, Gauthier-Villars \/ Mouton, 1972.","DOI":"10.1515\/9783111544526"},{"key":"3_CR15","unstructured":"LENTIN, A. et M.P. SCH\u00dcTZENBERGER: A combinatorial Problem in the Theory of Free Monoids, in Combinatorial Mathematics and its Applications, Bose and Dowling, eds., University of North Carolina Press, 1969, p.128\u2013144."},{"key":"3_CR16","unstructured":"NIVAT, M.: El\u00e9ments de la th\u00e9orie g\u00e9n\u00e9rale des codes, in Automata Theory, E. R. Caianiello, Ed., Academic Press 1966, p. 278\u2013294."},{"key":"3_CR17","unstructured":"PERRIN, D.: Codes asynchrones, \u00e0 para\u00eetre au Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France."},{"key":"3_CR18","unstructured":"PERRIN, D.: La transitivit\u00e9 du groupe d'un code bipr\u00e9fixe fini, \u00e0 para\u00eetre dans Math. Zeitschrift."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"PERROT, J-F.: Groupes de permutations associ\u00e9s aux codes pr\u00e9fixes finis, in Permutations, Actes d'un Colloque r\u00e9unis par A. Lentin, Gauthier-Villars\/Mouton, 1974, p. 19\u201335.","DOI":"10.1515\/9783112311943-006"},{"key":"3_CR20","first-page":"317","volume":"7","author":"G. Pollak","year":"1972","unstructured":"POLLAK, G.: On free Subsemigroups of free semigroup, Studia Sci. Math. Hungarica 7(1972) 317\u2013319.","journal-title":"Studia Sci. Math. Hungarica"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"RESTIVO, A.: Codes and aperiodic languages, in 1. Fachtagung \u00fcber Automatentheorie und formale Sprachen, Lecture Notes in Computer Science no2, Springer 1973, 175\u2013181.","DOI":"10.1007\/BFb0039152"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0019-9958(74)90821-3","volume":"25","author":"A. Restivo","year":"1974","unstructured":"RESTIVO, A.: On a Question of Mc Naughton and Papert, Information and Control 25(1974) 93\u2013101.","journal-title":"Information and Control"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(75)90015-8","volume":"1","author":"A. Restivo","year":"1975","unstructured":"RESTIVO, A.: A Combinatorial Property of Codes having finite Synchronization Delay, Theoretical Computer Science 1 (1975) 95\u2013101.","journal-title":"Theoretical Computer Science"},{"key":"3_CR24","unstructured":"RESTIVO, A.: On a Family of Codes related to factorization of Cyclotomic polynomials, in Automata, Languages, and Programming 3rd Int. Colloquium, S. Michaelson and R. Milner, Eds., Edinburgh University Press, 1976, p. 38\u201344."},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/S0019-9958(67)80002-0","volume":"10","author":"J. A. Riley","year":"1967","unstructured":"RILEY, J.A.: The Sardinas\/Patterson and Levenshtein theorems, Information and Control 10 (1967) 120\u2013136.","journal-title":"Information and Control"},{"key":"3_CR26","unstructured":"SCHUTZENBERGER, M.P.: Une th\u00e9orie alg\u00e9brique du codage, S\u00e9minaire Dubreil-Pisot, Ann\u00e9e 1955\/56, Expos\u00e9 no15, 24p. (Institut Henri Poincar\u00e9, Paris), et C.R. Acad. Sci. Paris 242 (1956) 862\u2013864."},{"key":"3_CR27","unstructured":"SCHUTZENBERGER, M.P.: On an application of Semigroup methods to some problems in coding, I.R.E. Trans. on Information theory, I.T.2, (1956) 47\u201360."},{"key":"3_CR28","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0021-9800(66)80015-7","volume":"1","author":"M. P. Schutzenberger","year":"1966","unstructured":"SCHUTZENBERGER, M.P.: On a Question concerning Certain Free submonoids, J. Comb. Theory 1(1966) 437\u2013442.","journal-title":"J. Comb. Theory"},{"key":"3_CR29","doi-asserted-by":"crossref","first-page":"209","DOI":"10.24033\/bsmf.1623","volume":"93","author":"M. P. Schutzenberger","year":"1965","unstructured":"SCHUTZENBERGER, M.P.: Sur certains sous-mono\u00efdes libres, Bull. Soc. Math. France 93 (1965) 209\u2013223.","journal-title":"Bull. Soc. Math. France"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"SCHUTZENBERGER, M.P.: Sur les mono\u00efdes finis dont les groupes sont commutatifs, R.A.I.R.O R-1, 1974, 55\u201361.","DOI":"10.1051\/ita\/197408R100551"},{"key":"3_CR31","unstructured":"SCHUTZENBERGER, M.P.: Sur certaines op\u00e9rations de fermeture dans les langages rationnels, Symposia Mathematica XV(1975)."},{"key":"3_CR32","unstructured":"SCHUTZENBERGER, M.P.: Sur certaines pseudo-vari\u00e9t\u00e9s de mono\u00efdes finis, Rapport IRIA-Laboria no62, 1974."},{"key":"3_CR33","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/BF02194863","volume":"9","author":"J-C. Spehner","year":"1975","unstructured":"SPEHNER, J-C.: Quelques constructions et algorithmes relatifs aux sous-mono\u00efdes d'un mono\u00efde libre, Semigroup Forum 9 (1975) 334\u2013353.","journal-title":"Semigroup Forum"},{"key":"3_CR34","unstructured":"SPEHNER, J-C.: Quelques probl\u00e8mes d'extension, de conjugaison et de pr\u00e9sentation des sous-mono\u00efdes d'un mono\u00efde libre, Th\u00e8se Sc.Math, Univ. Paris VII, 1976."},{"key":"3_CR35","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02570808","volume":"4","author":"B. Tilson","year":"1972","unstructured":"TILSON, B.: The intersection of free submonoids of a free monoid is free, Semigroup Forum 4 (1972) 345\u2013350.","journal-title":"Semigroup Forum"},{"key":"3_CR36","unstructured":"VIENNOT, G.: Alg\u00e8bres de Lie libres et mono\u00efdes libres, Th\u00e8se Sc.Math., Univ. Paris VII, 1974."},{"key":"3_CR37","first-page":"341","volume":"1","author":"G. Viennot","year":"1975","unstructured":"VIENNOT, G.: Un probl\u00e8me combinatoire sur les mots ne se chevauchant pas, in Journ\u00e9es de Combinatoire et Informatique, Univ. Bordeaux 1, 1975, p. 341\u2013351.","journal-title":"Journ\u00e9es de Combinatoire et Informatique, Univ. Bordeaux"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08138-0_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:51:22Z","timestamp":1619556682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08138-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"ISBN":["9783540081388","9783540373896"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/3-540-08138-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1977]]}}}