@article{BSMF_1977__105__385_0, author = {Perrin, Dominique}, title = {Codes asynchrones}, journal = {Bulletin de la Soci\'et\'e Math\'ematique de France}, pages = {385--404}, publisher = {Soci\'et\'e math\'ematique de France}, volume = {105}, year = {1977}, doi = {10.24033/bsmf.1857}, zbl = {0391.94017}, mrnumber = {57 #11956}, language = {fr}, url = {http://archive.numdam.org/articles/10.24033/bsmf.1857/} }
TY - JOUR AU - Perrin, Dominique TI - Codes asynchrones JO - Bulletin de la Société Mathématique de France PY - 1977 DA - 1977/// SP - 385 EP - 404 VL - 105 PB - Société mathématique de France UR - http://archive.numdam.org/articles/10.24033/bsmf.1857/ UR - https://zbmath.org/?q=an%3A0391.94017 UR - https://www.ams.org/mathscinet-getitem?mr=57 #11956 UR - https://doi.org/10.24033/bsmf.1857 DO - 10.24033/bsmf.1857 LA - fr ID - BSMF_1977__105__385_0 ER -
Perrin, Dominique. Codes asynchrones. Bulletin de la Société Mathématique de France, Tome 105 (1977), pp. 385-404. doi : 10.24033/bsmf.1857. http://archive.numdam.org/articles/10.24033/bsmf.1857/
[1] 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
. - Sur l'application du théorème de Suschkevitch à l'étude des codes rationnels complets,[2] Sur un algorithme donnant les codes bipréfixes finis, Math. Syst. Theory, t. 6, 1972, p. 221-225. | MR 47 #8193 | Zbl 0241.94015
. -[3] The algebraic theory of semigroups. Vol. 1. - Providence, American mathematical Society, 1961 (Mathematical Surveys, 7). | MR 24 #A2627 | Zbl 0111.03403
and . -[4] Free rings and their relations. - London, Academic Press, 1971 (London mathematical Society Monographs, 2). | MR 51 #8155 | Zbl 0232.16003
. -[5] 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
. -[6] 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
. -[7] Variable length binary encodings, Bell. Syst. Techn. J., t. 38, 1959, p. 933-967. | MR 21 #7129
and . -[8] Codes with bounded synchronisation delay, Information and Control, t. 8, 1965, p. 355-372. | MR 31 #4648 | Zbl 0202.50404
and . -[9] Automata theory, p. 278-294. - New York, Academic Press, 1966. | MR 39 #2513 | Zbl 0208.45101
. - Éléments de la théorie générale des codes,[10] La transitivité du groupe d'un code bipréfixe fini, Mathematische Z., t. 153, 1977, p. 283-287. | MR 56 #2641 | Zbl 0337.94005
. -[11] 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
. -[12] 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
. -[13] On the factorization of finite abelian groups, Acta Math. Acad. Sc. Hungaricae, t. 8, 1957, p. 65-86. | MR 19,529c | Zbl 0079.03303
. -[14] The factorisation of abelian groups, Quart. J. Math. Oxford Series 2, t. 10, 1959, p. 81-91. | MR 22 #65 | Zbl 0087.25604
. -[15] Séminaire Dubreil-Pisot : algèbre et théorie des nombres, 9e année, 1955-1956, n° 15, 24 p. | Numdam
. - Une théorie algébrique du codage,[16] On a special class of recurrent events, Annals of math. Stat., t. 32, 1961, p. 1201-1213. | MR 24 #A3718 | Zbl 0243.60049
. -[17] Sur certains sous-monoïdes libres, Bull. Soc. math. France, t. 93, 1965, p. 209-223. | Numdam | MR 32 #7666 | Zbl 0149.02601
. -[18] Algèbres de Lie libres et monoïdes libres, Thèse, Sc. math. Univ. Paris-VII, 1974.
. -Cité par Sources :