Codes asynchrones

 Access to full text

 Full (PDF)

1. [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). Zbl0338.94004
2. [2] CESARI (Y.). — Sur un algorithme donnant les codes bipréfixes finis, Math. Syst. Theory, t. 6, 1972, p. 221-225. Zbl0241.94015MR47 #8193
3. [3] CLIFFORD (A. H.) and PRESTON (G. B.). — The algebraic theory of semigroups. Vol. 1. — Providence, American mathematical Society, 1961 (Mathematical Surveys, 7). Zbl0111.03403MR24 #A2627
4. [4] COHN (P. M.). — Free rings and their relations. — London, Academic Press, 1971 (London mathematical Society Monographs, 2). Zbl0232.16003MR51 #8155
5. [5] EILENBERG (S.). — Automata, languages and machines. Vol. A. — New York, Academic Press, 1974 (Pure and applied Mathematics. Academic Press, 59-A). Zbl0317.94045MR58 #26604a
6. [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). Zbl0077.12201
7. [7] GILBERT (E. N.) and MOORE (E. F.). — Variable length binary encodings, Bell. Syst. Techn. J., t. 38, 1959, p. 933-967. MR21 #7129
8. [8] GOLOMB (S. W.) and GORDON (B.). — Codes with bounded synchronisation delay, Information and Control, t. 8, 1965, p. 355-372. Zbl0202.50404MR31 #4648
9. [9] NIVAT (M.). — Éléments de la théorie générale des codes, Automata theory, p. 278-294. — New York, Academic Press, 1966. Zbl0208.45101MR39 #2513
10. [10] PERRIN (D.). — La transitivité du groupe d'un code bipréfixe fini, Mathematische Z., t. 153, 1977, p. 283-287. Zbl0337.94005MR56 #2641
11. [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. Zbl0294.94004
12. [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). Zbl0374.94009
13. [13] SANDS (A. D.). — On the factorization of finite abelian groups, Acta Math. Acad. Sc. Hungaricae, t. 8, 1957, p. 65-86. Zbl0079.03303MR19,529c
14. [14] SANDS (A. D.). — The factorisation of abelian groups, Quart. J. Math. Oxford Series 2, t. 10, 1959, p. 81-91. Zbl0087.25604MR22 #65
15. [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° 15, 24 p. 
16. [16] SCHÜTZENBERGER (M. P.). — On a special class of recurrent events, Annals of math. Stat., t. 32, 1961, p. 1201-1213. Zbl0243.60049MR24 #A3718
17. [17] SCHÜTZENBERGER (M. P.). — Sur certains sous-monoïdes libres, Bull. Soc. math. France, t. 93, 1965, p. 209-223. Zbl0149.02601MR32 #7666
18. [18] VIENNOT (G.). — Algèbres de Lie libres et monoïdes libres, Thèse, Sc. math. Univ. Paris-VII, 1974. 

1. Véronique Bruyère, Factorisation des ensembles préfixiels
2. Max Vincent, Construction de codes indécomposables
3. Clelia De Felice, On a complete set of operations for factorizing codes
4. Clelia De Felice, On a complete set of operations for factorizing codes