@article{SMS_1969-1970__1__A8_0, author = {Perrin, Dominique}, title = {Sous-mono{\"\i}des et automates}, journal = {S\'eminaire Sch\"utzenberger}, note = {talk:10}, pages = {1--23}, publisher = {Secr\'etariat math\'ematique}, volume = {1}, year = {1969-1970}, mrnumber = {284525}, zbl = {0228.20064}, language = {fr}, url = {http://archive.numdam.org/item/SMS_1969-1970__1__A8_0/} }
Perrin, Dominique. Sous-monoïdes et automates. Séminaire Schützenberger, Tome 1 (1969-1970), Exposé no. 10, 23 p. http://archive.numdam.org/item/SMS_1969-1970__1__A8_0/
[1] Algebraic theory of automata. - New York, Academic Press, 1968. | MR | Zbl
. -[2] Eléments de la théorie générale des codes, Automata theory, p. 278-294. - New York, Academic Press, 1966. | MR | Zbl
. -[3] Sur les codes préfixes complets finis, C. R. Acad. Sc. Paris, t. 269, 1969, Série A, p. 1116-1118. | MR | Zbl
et . -[4] On the relationship between finite automata, finite monoïds, and prefix codes, Proceedings of the ACM Symposium on theory of computing [1970. Northampton (Mass.)] (à paraître).
. -[5] On a family of submonoïds, Publ. math. Inst. Hung. Acad. Sc., t. 6, 1961, p. 381-391. | MR | Zbl
. -[6] On an application of semigroup methods to some problems of coding, IRE Transactions on Information Theory, IT-2, 1956, p. 47-60.
. -