×

Codes asynchrones. (French) Zbl 0391.94017


MSC:

94A45 Prefix, length-variable, comma-free codes
PDFBibTeX XMLCite
Full Text: DOI Numdam EuDML

References:

[1] CESARI (Y.) . - Sur l’application du théorème de Suschkevitch à l’étude des codes rationnels complets, Automata, languages and programming . [ 1974 , Saarbrücken]. Edited by J. Loeckx, p. 342-350. - Berlin, Springer-Verlag, 1974 (Lectures Notes in Computer Science, 14). Zbl 0338.94004 · Zbl 0338.94004
[2] CESARI (Y.) . - Sur un algorithme donnant les codes bipréfixes finis , Math. Syst. Theory, t. 6, 1972 , p. 221-225. MR 47 #8193 | Zbl 0241.94015 · Zbl 0241.94015 · doi:10.1007/BF01706090
[3] CLIFFORD (A. H.) and PRESTON (G. B.) . - The algebraic theory of semigroups . Vol. 1. - Providence, American mathematical Society, 1961 (Mathematical Surveys, 7). MR 24 #A2627 | Zbl 0111.03403 · Zbl 0111.03403
[4] COHN (P. M.) . - Free rings and their relations . - London, Academic Press, 1971 (London mathematical Society Monographs, 2). MR 51 #8155 | Zbl 0232.16003 · Zbl 0232.16003
[5] EILENBERG (S.) . - Automata, languages and machines . Vol. A. - New York, Academic Press, 1974 (Pure and applied Mathematics. Academic Press, 59-A). MR 58 #26604a | Zbl 0317.94045 · Zbl 0317.94045
[6] FELLER (W.) . - An introduction to probability theory and its applications . Vol. 1, 2nd edition. - New York, J. Wiley and Sons, 1957 (Wiley Publications in Statistics). Zbl 0077.12201 · Zbl 0077.12201
[7] GILBERT (E. N.) and MOORE (E. F.) . - Variable length binary encodings , Bell. Syst. Techn. J., t. 38, 1959 , p. 933-967. MR 21 #7129
[8] GOLOMB (S. W.) and GORDON (B.) . - Codes with bounded synchronisation delay , Information and Control, t. 8, 1965 , p. 355-372. MR 31 #4648 | Zbl 0202.50404 · Zbl 0202.50404 · doi:10.1016/S0019-9958(65)90300-1
[9] NIVAT (M.) . - Éléments de la théorie générale des codes, Automata theory , p. 278-294. - New York, Academic Press, 1966 . MR 39 #2513 | Zbl 0208.45101 · Zbl 0208.45101
[10] PERRIN (D.) . - La transitivité du groupe d’un code bipréfixe fini , Mathematische Z., t. 153, 1977 , p. 283-287. Article | MR 56 #2641 | Zbl 0337.94005 · Zbl 0337.94005 · doi:10.1007/BF01214481
[11] PERROT (J.-F.) . - Groupes de permutations associés aux codes préfixes finis , Permutations. Actes du colloque sur les permutations [ 1972 . Paris], p. 201-235. - Paris, Gauthier-Villars ; La Haye, Mouton, 1974 . Zbl 0294.94004 · Zbl 0294.94004
[12] PERROT (J.-F.) . - Computer science and algebra : the theory of variable length codes , Theoretical Computer Science, p. 27-44. - Berlin, Springer-Verlag, 1976 (Lecture Notes in Computer Science, 48). Zbl 0374.94009 · Zbl 0374.94009
[13] SANDS (A. D.) . - On the factorization of finite abelian groups , Acta Math. Acad. Sc. Hungaricae, t. 8, 1957 , p. 65-86. MR 19,529c | Zbl 0079.03303 · Zbl 0079.03303 · doi:10.1007/BF02025232
[14] SANDS (A. D.) . - The factorisation of abelian groups , Quart. J. Math. Oxford Series 2, t. 10, 1959 , p. 81-91. MR 22 #65 | Zbl 0087.25604 · Zbl 0087.25604 · doi:10.1093/qmath/10.1.81
[15] SCHÜTZENBERGER (M. P.) . - Une théorie algébrique du codage, Séminaire Dubreil-Pisot : algèbre et théorie des nombres , 9e année, 1955 - 1956 , n^\circ 15, 24 p. Numdam
[16] SCHÜTZENBERGER (M. P.) . - On a special class of recurrent events , Annals of math. Stat., t. 32, 1961 , p. 1201-1213. Article | MR 24 #A3718 | Zbl 0243.60049 · Zbl 0243.60049 · doi:10.1214/aoms/1177704860
[17] SCHÜTZENBERGER (M. P.) . - Sur certains sous-monoïdes libres , Bull. Soc. math. France, t. 93, 1965 , p. 209-223. Numdam | MR 32 #7666 | Zbl 0149.02601 · Zbl 0149.02601
[18] VIENNOT (G.) . - Algèbres de Lie libres et monoïdes libres , Thèse, Sc. math. Univ. Paris-VII, 1974 .
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.